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/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:13:38,694 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:13:38,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:13:38,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:13:38,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:13:38,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:13:38,712 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:13:38,714 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:13:38,716 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:13:38,717 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:13:38,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:13:38,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:13:38,719 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:13:38,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:13:38,722 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:13:38,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:13:38,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:13:38,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:13:38,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:13:38,730 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:13:38,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:13:38,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:13:38,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:13:38,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:13:38,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:13:38,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:13:38,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:13:38,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:13:38,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:13:38,753 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:13:38,753 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:13:38,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:13:38,756 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:13:38,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:13:38,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:13:38,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:13:38,760 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 13:13:38,778 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:13:38,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:13:38,779 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:13:38,779 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:13:38,779 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:13:38,779 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:13:38,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:13:38,780 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:13:38,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:13:38,781 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:13:38,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:13:38,781 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:13:38,781 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:13:38,782 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:13:38,783 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:13:38,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:13:38,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:13:38,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:13:38,865 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:13:38,866 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:13:38,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_4.bpl [2018-10-15 13:13:38,867 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_4.bpl' [2018-10-15 13:13:38,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:13:38,925 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:13:38,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:13:38,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:13:38,926 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:13:38,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (1/1) ... [2018-10-15 13:13:38,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (1/1) ... [2018-10-15 13:13:38,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (1/1) ... [2018-10-15 13:13:38,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (1/1) ... [2018-10-15 13:13:38,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (1/1) ... [2018-10-15 13:13:38,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (1/1) ... [2018-10-15 13:13:38,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (1/1) ... [2018-10-15 13:13:38,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:13:38,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:13:38,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:13:38,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:13:38,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (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 13:13:39,041 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:13:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:13:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:13:39,303 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:13:39,304 INFO L202 PluginConnector]: Adding new model string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:39 BoogieIcfgContainer [2018-10-15 13:13:39,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:13:39,304 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:13:39,305 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:13:39,306 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:13:39,311 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:39" (1/1) ... [2018-10-15 13:13:39,322 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:13:39,346 INFO L202 PluginConnector]: Adding new model string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:13:39 BasicIcfg [2018-10-15 13:13:39,346 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:13:39,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:13:39,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:13:39,352 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:13:39,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:38" (1/3) ... [2018-10-15 13:13:39,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ceeae54 and model type string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:13:39, skipping insertion in model container [2018-10-15 13:13:39,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:39" (2/3) ... [2018-10-15 13:13:39,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ceeae54 and model type string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:13:39, skipping insertion in model container [2018-10-15 13:13:39,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:13:39" (3/3) ... [2018-10-15 13:13:39,358 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_true-termination.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 13:13:39,370 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:13:39,383 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:13:39,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:13:39,441 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:13:39,442 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:13:39,442 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:13:39,443 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:13:39,443 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:13:39,443 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:13:39,443 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:13:39,443 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:13:39,444 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:13:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-15 13:13:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 13:13:39,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:39,481 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 13:13:39,483 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:39,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:39,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1020625999, now seen corresponding path program 1 times [2018-10-15 13:13:39,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:39,838 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 13:13:39,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:13:39,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 13:13:39,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:13:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:13:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:13:39,863 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2018-10-15 13:13:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:40,059 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-15 13:13:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:13:40,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 13:13:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:40,075 INFO L225 Difference]: With dead ends: 38 [2018-10-15 13:13:40,075 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 13:13:40,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:13:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 13:13:40,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-10-15 13:13:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 13:13:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 13:13:40,117 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2018-10-15 13:13:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:40,118 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 13:13:40,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:13:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 13:13:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 13:13:40,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:40,119 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:40,120 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:40,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2091171995, now seen corresponding path program 1 times [2018-10-15 13:13:40,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:40,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:40,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:13:40,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:13:40,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:13:40,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:13:40,559 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 7 states. [2018-10-15 13:13:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:41,026 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-15 13:13:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 13:13:41,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-15 13:13:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:41,030 INFO L225 Difference]: With dead ends: 47 [2018-10-15 13:13:41,030 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 13:13:41,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 13:13:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-10-15 13:13:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 13:13:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 13:13:41,038 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2018-10-15 13:13:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:41,039 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 13:13:41,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:13:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 13:13:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 13:13:41,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:41,041 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:41,041 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:41,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1718066447, now seen corresponding path program 2 times [2018-10-15 13:13:41,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:41,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:41,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:13:41,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:13:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:13:41,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:13:41,291 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 9 states. [2018-10-15 13:13:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:41,623 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 13:13:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:13:41,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-10-15 13:13:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:41,626 INFO L225 Difference]: With dead ends: 56 [2018-10-15 13:13:41,626 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 13:13:41,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 13:13:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-15 13:13:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 13:13:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 13:13:41,643 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 37 [2018-10-15 13:13:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:41,643 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 13:13:41,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:13:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 13:13:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 13:13:41,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:41,649 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:41,650 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:41,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash 397999781, now seen corresponding path program 3 times [2018-10-15 13:13:41,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:41,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:41,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:13:41,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:13:41,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:13:41,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:41,997 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 11 states. [2018-10-15 13:13:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:42,397 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 13:13:42,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 13:13:42,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-10-15 13:13:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:42,399 INFO L225 Difference]: With dead ends: 65 [2018-10-15 13:13:42,399 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 13:13:42,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:13:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 13:13:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-15 13:13:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 13:13:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 13:13:42,408 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 46 [2018-10-15 13:13:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:42,408 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 13:13:42,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:13:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 13:13:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 13:13:42,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:42,410 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:42,411 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:42,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1215104463, now seen corresponding path program 4 times [2018-10-15 13:13:42,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:42,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:42,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:13:42,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:13:42,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:13:42,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:13:42,653 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2018-10-15 13:13:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:43,248 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 13:13:43,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:13:43,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-10-15 13:13:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:43,250 INFO L225 Difference]: With dead ends: 74 [2018-10-15 13:13:43,250 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 13:13:43,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:13:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 13:13:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2018-10-15 13:13:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 13:13:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 13:13:43,260 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 55 [2018-10-15 13:13:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:43,262 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 13:13:43,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:13:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 13:13:43,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 13:13:43,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:43,264 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:43,264 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:43,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1201836571, now seen corresponding path program 5 times [2018-10-15 13:13:43,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:43,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:43,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:13:43,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:13:43,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:13:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:43,651 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 15 states. [2018-10-15 13:13:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:44,014 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-15 13:13:44,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 13:13:44,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-10-15 13:13:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:44,017 INFO L225 Difference]: With dead ends: 83 [2018-10-15 13:13:44,017 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 13:13:44,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:13:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 13:13:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-10-15 13:13:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 13:13:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-15 13:13:44,025 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 64 [2018-10-15 13:13:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:44,026 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-15 13:13:44,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:13:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-15 13:13:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 13:13:44,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:44,028 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:44,028 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:44,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 179420815, now seen corresponding path program 6 times [2018-10-15 13:13:44,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:44,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:44,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:13:44,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:13:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:13:44,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:13:44,424 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 17 states. [2018-10-15 13:13:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:44,832 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-15 13:13:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:13:44,832 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-10-15 13:13:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:44,834 INFO L225 Difference]: With dead ends: 92 [2018-10-15 13:13:44,834 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 13:13:44,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:13:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 13:13:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-10-15 13:13:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 13:13:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 13:13:44,843 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 73 [2018-10-15 13:13:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:44,844 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 13:13:44,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:13:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 13:13:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 13:13:44,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:44,845 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:44,846 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:44,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:44,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1123847461, now seen corresponding path program 7 times [2018-10-15 13:13:44,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:45,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:45,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:13:45,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:13:45,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:13:45,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:13:45,120 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 19 states. [2018-10-15 13:13:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:46,120 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-15 13:13:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 13:13:46,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-10-15 13:13:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:46,123 INFO L225 Difference]: With dead ends: 101 [2018-10-15 13:13:46,123 INFO L226 Difference]: Without dead ends: 95 [2018-10-15 13:13:46,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:13:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-15 13:13:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-15 13:13:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 13:13:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-15 13:13:46,132 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 82 [2018-10-15 13:13:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:46,132 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-15 13:13:46,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:13:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-15 13:13:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 13:13:46,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:46,134 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:46,134 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:46,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash -100546737, now seen corresponding path program 8 times [2018-10-15 13:13:46,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:46,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:46,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:13:46,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:13:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:13:46,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:13:46,495 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 21 states. [2018-10-15 13:13:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:47,031 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-15 13:13:47,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:13:47,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 91 [2018-10-15 13:13:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:47,033 INFO L225 Difference]: With dead ends: 110 [2018-10-15 13:13:47,034 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 13:13:47,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:13:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 13:13:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-15 13:13:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 13:13:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 13:13:47,042 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 91 [2018-10-15 13:13:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:47,043 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 13:13:47,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:13:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 13:13:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:13:47,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:47,045 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:47,045 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:47,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash 273308773, now seen corresponding path program 9 times [2018-10-15 13:13:47,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:47,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:47,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:13:47,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:13:47,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:13:47,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:13:47,423 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 23 states. [2018-10-15 13:13:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:48,188 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 13:13:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 13:13:48,189 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-10-15 13:13:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:48,190 INFO L225 Difference]: With dead ends: 119 [2018-10-15 13:13:48,191 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 13:13:48,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:13:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 13:13:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-10-15 13:13:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 13:13:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 13:13:48,199 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 100 [2018-10-15 13:13:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:48,200 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 13:13:48,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:13:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 13:13:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 13:13:48,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:48,201 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:48,202 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:48,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1210654735, now seen corresponding path program 10 times [2018-10-15 13:13:48,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:48,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:48,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:13:48,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:13:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:13:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:13:48,494 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 25 states. [2018-10-15 13:13:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:48,948 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 13:13:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:13:48,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2018-10-15 13:13:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:48,950 INFO L225 Difference]: With dead ends: 128 [2018-10-15 13:13:48,951 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 13:13:48,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=617, Invalid=1545, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:13:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 13:13:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-10-15 13:13:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 13:13:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 13:13:48,957 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 109 [2018-10-15 13:13:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:48,958 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 13:13:48,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:13:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 13:13:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:13:48,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:48,960 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:48,960 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:48,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:48,960 INFO L82 PathProgramCache]: Analyzing trace with hash 872078245, now seen corresponding path program 11 times [2018-10-15 13:13:48,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:49,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:49,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:13:49,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:13:49,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:13:49,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:13:49,333 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 27 states. [2018-10-15 13:13:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:49,892 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 13:13:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:13:49,892 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 118 [2018-10-15 13:13:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:49,894 INFO L225 Difference]: With dead ends: 137 [2018-10-15 13:13:49,894 INFO L226 Difference]: Without dead ends: 131 [2018-10-15 13:13:49,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=732, Invalid=1818, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:13:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-15 13:13:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2018-10-15 13:13:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 13:13:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 13:13:49,900 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 118 [2018-10-15 13:13:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:49,901 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 13:13:49,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:13:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 13:13:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:13:49,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:49,903 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:49,903 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:49,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash -873215793, now seen corresponding path program 12 times [2018-10-15 13:13:49,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:50,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:50,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:13:50,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:13:50,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:13:50,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:13:50,983 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 29 states. [2018-10-15 13:13:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:52,265 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-15 13:13:52,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:13:52,266 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 127 [2018-10-15 13:13:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:52,272 INFO L225 Difference]: With dead ends: 146 [2018-10-15 13:13:52,273 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 13:13:52,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=857, Invalid=2113, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:13:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 13:13:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-10-15 13:13:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 13:13:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 13:13:52,278 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 127 [2018-10-15 13:13:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:52,283 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 13:13:52,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:13:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 13:13:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:13:52,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:52,286 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:52,286 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:52,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1128133915, now seen corresponding path program 13 times [2018-10-15 13:13:52,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:52,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:52,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:13:52,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:13:52,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:13:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:13:52,793 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 31 states. [2018-10-15 13:13:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:54,447 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-15 13:13:54,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:13:54,448 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 136 [2018-10-15 13:13:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:54,449 INFO L225 Difference]: With dead ends: 155 [2018-10-15 13:13:54,449 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 13:13:54,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=992, Invalid=2430, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:13:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 13:13:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-15 13:13:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 13:13:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 13:13:54,455 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 136 [2018-10-15 13:13:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:54,456 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 13:13:54,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:13:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 13:13:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:13:54,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:54,458 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:54,458 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:54,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:54,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1053965937, now seen corresponding path program 14 times [2018-10-15 13:13:54,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 0 proven. 847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:55,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:13:55,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:13:55,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:13:55,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:13:55,091 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 33 states. [2018-10-15 13:13:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:55,891 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 13:13:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:13:55,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 145 [2018-10-15 13:13:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:55,893 INFO L225 Difference]: With dead ends: 164 [2018-10-15 13:13:55,893 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 13:13:55,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1137, Invalid=2769, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:13:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 13:13:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2018-10-15 13:13:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 13:13:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 13:13:55,899 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 145 [2018-10-15 13:13:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:55,899 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 13:13:55,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:13:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 13:13:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:13:55,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:55,901 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:55,901 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:55,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash -195827163, now seen corresponding path program 15 times [2018-10-15 13:13:55,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:56,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:56,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:13:56,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:13:56,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:13:56,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:13:56,554 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 35 states. [2018-10-15 13:13:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:57,327 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-15 13:13:57,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:13:57,328 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 154 [2018-10-15 13:13:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:57,330 INFO L225 Difference]: With dead ends: 173 [2018-10-15 13:13:57,330 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 13:13:57,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1292, Invalid=3130, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:13:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 13:13:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-10-15 13:13:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 13:13:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 13:13:57,336 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 154 [2018-10-15 13:13:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:57,336 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 13:13:57,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:13:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 13:13:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:13:57,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:57,337 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:57,338 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:57,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2002580913, now seen corresponding path program 16 times [2018-10-15 13:13:57,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 0 proven. 1112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:57,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:57,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:13:57,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:13:57,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:13:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:13:57,886 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 37 states. [2018-10-15 13:13:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:58,839 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-15 13:13:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:13:58,840 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 163 [2018-10-15 13:13:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:58,842 INFO L225 Difference]: With dead ends: 182 [2018-10-15 13:13:58,842 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 13:13:58,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1457, Invalid=3513, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:13:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 13:13:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2018-10-15 13:13:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 13:13:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 13:13:58,848 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 163 [2018-10-15 13:13:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:58,848 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 13:13:58,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:13:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 13:13:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:13:58,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:58,849 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:58,850 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:58,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1620805275, now seen corresponding path program 17 times [2018-10-15 13:13:58,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 1258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:59,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:59,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:13:59,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:13:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:13:59,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:13:59,780 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 39 states. [2018-10-15 13:14:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:00,737 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-15 13:14:00,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:14:00,737 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 172 [2018-10-15 13:14:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:00,740 INFO L225 Difference]: With dead ends: 191 [2018-10-15 13:14:00,740 INFO L226 Difference]: Without dead ends: 185 [2018-10-15 13:14:00,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:14:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-15 13:14:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-10-15 13:14:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:14:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-15 13:14:00,746 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 172 [2018-10-15 13:14:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:00,746 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-15 13:14:00,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:14:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-15 13:14:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:14:00,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:00,748 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:00,748 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:00,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:00,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1746903823, now seen corresponding path program 18 times [2018-10-15 13:14:00,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1413 backedges. 0 proven. 1413 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:01,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:01,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:14:01,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:14:01,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:14:01,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:14:01,417 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 41 states. [2018-10-15 13:14:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:02,616 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-15 13:14:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:14:02,616 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 181 [2018-10-15 13:14:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:02,618 INFO L225 Difference]: With dead ends: 200 [2018-10-15 13:14:02,618 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 13:14:02,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1817, Invalid=4345, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:14:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 13:14:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-10-15 13:14:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 13:14:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 13:14:02,624 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 181 [2018-10-15 13:14:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:02,624 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 13:14:02,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:14:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 13:14:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:14:02,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:02,625 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:02,626 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:02,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:02,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1034401957, now seen corresponding path program 19 times [2018-10-15 13:14:02,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:03,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:03,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:14:03,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:14:03,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:14:03,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:14:03,632 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 43 states. [2018-10-15 13:14:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:04,963 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 13:14:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:14:04,964 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 190 [2018-10-15 13:14:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:04,966 INFO L225 Difference]: With dead ends: 209 [2018-10-15 13:14:04,966 INFO L226 Difference]: Without dead ends: 203 [2018-10-15 13:14:04,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2012, Invalid=4794, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:14:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-15 13:14:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2018-10-15 13:14:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:14:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 13:14:04,973 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 190 [2018-10-15 13:14:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:04,974 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 13:14:04,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:14:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 13:14:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:14:04,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:04,975 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:04,975 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:04,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:04,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1248824271, now seen corresponding path program 20 times [2018-10-15 13:14:04,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1750 backedges. 0 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:06,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:06,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:14:06,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:14:06,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:14:06,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:14:06,192 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 45 states. [2018-10-15 13:14:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:07,315 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-15 13:14:07,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:14:07,316 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 199 [2018-10-15 13:14:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:07,318 INFO L225 Difference]: With dead ends: 218 [2018-10-15 13:14:07,318 INFO L226 Difference]: Without dead ends: 212 [2018-10-15 13:14:07,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2217, Invalid=5265, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:14:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-15 13:14:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2018-10-15 13:14:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 13:14:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-15 13:14:07,324 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 199 [2018-10-15 13:14:07,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:07,324 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-15 13:14:07,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:14:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-15 13:14:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 13:14:07,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:07,326 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:07,326 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:07,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1238476773, now seen corresponding path program 21 times [2018-10-15 13:14:07,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1932 backedges. 0 proven. 1932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:08,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:08,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:14:08,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:14:08,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:14:08,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:14:08,084 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 47 states. [2018-10-15 13:14:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:09,748 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-15 13:14:09,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:14:09,751 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 208 [2018-10-15 13:14:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:09,753 INFO L225 Difference]: With dead ends: 227 [2018-10-15 13:14:09,753 INFO L226 Difference]: Without dead ends: 221 [2018-10-15 13:14:09,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2432, Invalid=5758, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:14:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-15 13:14:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-10-15 13:14:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 13:14:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 13:14:09,758 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 208 [2018-10-15 13:14:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:09,759 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 13:14:09,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:14:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 13:14:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 13:14:09,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:09,760 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:09,761 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:09,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:09,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2136917135, now seen corresponding path program 22 times [2018-10-15 13:14:09,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:10,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:14:10,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:14:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:14:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=1773, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:14:10,637 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 49 states. [2018-10-15 13:14:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:12,302 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-15 13:14:12,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:14:12,302 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-10-15 13:14:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:12,304 INFO L225 Difference]: With dead ends: 236 [2018-10-15 13:14:12,304 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 13:14:12,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2657, Invalid=6273, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:14:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 13:14:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-10-15 13:14:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 13:14:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 13:14:12,310 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 217 [2018-10-15 13:14:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:12,311 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 13:14:12,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:14:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 13:14:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 13:14:12,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:12,312 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:12,313 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:12,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:12,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2039891749, now seen corresponding path program 23 times [2018-10-15 13:14:12,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2323 backedges. 0 proven. 2323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:13,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:13,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:14:13,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:14:13,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:14:13,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:14:13,340 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 51 states. [2018-10-15 13:14:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:15,097 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-15 13:14:15,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:14:15,097 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 226 [2018-10-15 13:14:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:15,099 INFO L225 Difference]: With dead ends: 245 [2018-10-15 13:14:15,100 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 13:14:15,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2892, Invalid=6810, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:14:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 13:14:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-15 13:14:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 13:14:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 13:14:15,106 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 226 [2018-10-15 13:14:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:15,106 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 13:14:15,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:14:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 13:14:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 13:14:15,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:15,108 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:15,108 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:15,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2075741519, now seen corresponding path program 24 times [2018-10-15 13:14:15,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2532 backedges. 0 proven. 2532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:16,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:16,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:14:16,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:14:16,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:14:16,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=2077, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:14:16,077 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 53 states. [2018-10-15 13:14:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:19,802 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 13:14:19,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:14:19,802 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 235 [2018-10-15 13:14:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:19,804 INFO L225 Difference]: With dead ends: 254 [2018-10-15 13:14:19,805 INFO L226 Difference]: Without dead ends: 248 [2018-10-15 13:14:19,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3137, Invalid=7369, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:14:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-15 13:14:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2018-10-15 13:14:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 13:14:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 13:14:19,811 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 235 [2018-10-15 13:14:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:19,811 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 13:14:19,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:14:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 13:14:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 13:14:19,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:19,813 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:19,813 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:19,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash -39217563, now seen corresponding path program 25 times [2018-10-15 13:14:19,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2750 backedges. 0 proven. 2750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:21,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:21,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:14:21,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:14:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:14:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2238, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:14:21,110 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 55 states. [2018-10-15 13:14:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:22,984 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-15 13:14:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:14:22,985 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 244 [2018-10-15 13:14:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:22,987 INFO L225 Difference]: With dead ends: 263 [2018-10-15 13:14:22,987 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 13:14:22,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3392, Invalid=7950, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:14:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 13:14:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-10-15 13:14:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 13:14:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 13:14:22,993 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 244 [2018-10-15 13:14:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:22,993 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 13:14:22,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:14:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 13:14:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 13:14:22,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:22,995 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:22,995 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:22,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1723128305, now seen corresponding path program 26 times [2018-10-15 13:14:22,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2977 backedges. 0 proven. 2977 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:24,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:24,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:14:24,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:14:24,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:14:24,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=2405, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:14:24,786 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 57 states. [2018-10-15 13:14:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:26,781 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-15 13:14:26,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:14:26,781 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 253 [2018-10-15 13:14:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:26,784 INFO L225 Difference]: With dead ends: 272 [2018-10-15 13:14:26,784 INFO L226 Difference]: Without dead ends: 266 [2018-10-15 13:14:26,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3657, Invalid=8553, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:14:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-15 13:14:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2018-10-15 13:14:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 13:14:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 13:14:26,790 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 253 [2018-10-15 13:14:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:26,790 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 13:14:26,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:14:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 13:14:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 13:14:26,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:26,792 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:26,792 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:26,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:26,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1044408923, now seen corresponding path program 27 times [2018-10-15 13:14:26,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3213 backedges. 0 proven. 3213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:27,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:27,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:14:27,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:14:27,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:14:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2578, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:14:27,964 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 59 states. [2018-10-15 13:14:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:30,109 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 13:14:30,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 13:14:30,109 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 262 [2018-10-15 13:14:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:30,111 INFO L225 Difference]: With dead ends: 281 [2018-10-15 13:14:30,111 INFO L226 Difference]: Without dead ends: 275 [2018-10-15 13:14:30,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3932, Invalid=9178, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:14:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-15 13:14:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-10-15 13:14:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 13:14:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-15 13:14:30,116 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 262 [2018-10-15 13:14:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:30,117 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-15 13:14:30,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:14:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-15 13:14:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 13:14:30,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:30,118 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:30,119 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:30,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:30,119 INFO L82 PathProgramCache]: Analyzing trace with hash -689942833, now seen corresponding path program 28 times [2018-10-15 13:14:30,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3458 backedges. 0 proven. 3458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:31,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:31,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:14:31,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:14:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:14:31,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=2757, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:14:31,968 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 61 states. [2018-10-15 13:14:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:34,324 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-15 13:14:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:14:34,324 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 271 [2018-10-15 13:14:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:34,327 INFO L225 Difference]: With dead ends: 290 [2018-10-15 13:14:34,327 INFO L226 Difference]: Without dead ends: 284 [2018-10-15 13:14:34,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4217, Invalid=9825, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:14:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-15 13:14:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-10-15 13:14:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-15 13:14:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-15 13:14:34,334 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 271 [2018-10-15 13:14:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:34,334 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-15 13:14:34,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:14:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-15 13:14:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-15 13:14:34,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:34,337 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:34,337 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:34,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1400093467, now seen corresponding path program 29 times [2018-10-15 13:14:34,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3712 backedges. 0 proven. 3712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:35,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:35,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:14:35,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:14:35,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:14:35,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=2942, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:14:35,955 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 63 states. [2018-10-15 13:14:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:38,068 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-15 13:14:38,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 13:14:38,068 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 280 [2018-10-15 13:14:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:38,070 INFO L225 Difference]: With dead ends: 299 [2018-10-15 13:14:38,070 INFO L226 Difference]: Without dead ends: 293 [2018-10-15 13:14:38,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4512, Invalid=10494, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:14:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-15 13:14:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2018-10-15 13:14:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 13:14:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 13:14:38,076 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 280 [2018-10-15 13:14:38,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:38,076 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 13:14:38,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:14:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 13:14:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 13:14:38,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:38,077 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:38,078 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:38,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:38,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1740322929, now seen corresponding path program 30 times [2018-10-15 13:14:38,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3975 backedges. 0 proven. 3975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:39,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:39,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:14:39,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:14:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:14:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=3133, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:14:39,666 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 65 states. [2018-10-15 13:14:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:41,810 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-15 13:14:41,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 13:14:41,811 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 289 [2018-10-15 13:14:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:41,813 INFO L225 Difference]: With dead ends: 308 [2018-10-15 13:14:41,813 INFO L226 Difference]: Without dead ends: 302 [2018-10-15 13:14:41,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4817, Invalid=11185, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:14:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-15 13:14:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2018-10-15 13:14:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 13:14:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-15 13:14:41,818 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 289 [2018-10-15 13:14:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:41,819 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-15 13:14:41,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:14:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-15 13:14:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 13:14:41,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:41,820 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:41,820 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:41,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash -540826587, now seen corresponding path program 31 times [2018-10-15 13:14:41,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4247 backedges. 0 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:43,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:14:43,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:14:43,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:14:43,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=3330, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:14:43,366 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 67 states. [2018-10-15 13:14:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:46,059 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-15 13:14:46,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 13:14:46,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 298 [2018-10-15 13:14:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:46,062 INFO L225 Difference]: With dead ends: 317 [2018-10-15 13:14:46,062 INFO L226 Difference]: Without dead ends: 311 [2018-10-15 13:14:46,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5132, Invalid=11898, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:14:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-15 13:14:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2018-10-15 13:14:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:14:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-15 13:14:46,068 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 298 [2018-10-15 13:14:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:46,068 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-15 13:14:46,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:14:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-15 13:14:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 13:14:46,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:46,070 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:46,070 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:46,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1715769423, now seen corresponding path program 32 times [2018-10-15 13:14:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4528 backedges. 0 proven. 4528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:47,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:47,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:14:47,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:14:47,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:14:47,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1159, Invalid=3533, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:14:47,590 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 69 states. [2018-10-15 13:14:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:50,609 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2018-10-15 13:14:50,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 13:14:50,609 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 307 [2018-10-15 13:14:50,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:50,611 INFO L225 Difference]: With dead ends: 326 [2018-10-15 13:14:50,612 INFO L226 Difference]: Without dead ends: 320 [2018-10-15 13:14:50,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5457, Invalid=12633, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:14:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-15 13:14:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2018-10-15 13:14:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-15 13:14:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-15 13:14:50,617 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 307 [2018-10-15 13:14:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:50,618 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-15 13:14:50,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:14:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-15 13:14:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-15 13:14:50,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:50,620 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:50,620 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:50,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:50,621 INFO L82 PathProgramCache]: Analyzing trace with hash -132533403, now seen corresponding path program 33 times [2018-10-15 13:14:50,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:52,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:52,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:14:52,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:14:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:14:52,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=3742, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:14:52,628 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 71 states. [2018-10-15 13:14:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:55,552 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-15 13:14:55,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 13:14:55,552 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 316 [2018-10-15 13:14:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:55,555 INFO L225 Difference]: With dead ends: 335 [2018-10-15 13:14:55,555 INFO L226 Difference]: Without dead ends: 329 [2018-10-15 13:14:55,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5792, Invalid=13390, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:14:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-15 13:14:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2018-10-15 13:14:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:14:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-15 13:14:55,562 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 316 [2018-10-15 13:14:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:55,563 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-15 13:14:55,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:14:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-15 13:14:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-15 13:14:55,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:55,566 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:14:55,566 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:55,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:55,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1364481777, now seen corresponding path program 34 times [2018-10-15 13:14:55,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5117 backedges. 0 proven. 5117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:57,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:57,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:14:57,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:14:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:14:57,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=3957, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:14:57,611 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 73 states. [2018-10-15 13:15:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:00,487 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-15 13:15:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 13:15:00,487 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 325 [2018-10-15 13:15:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:00,490 INFO L225 Difference]: With dead ends: 344 [2018-10-15 13:15:00,490 INFO L226 Difference]: Without dead ends: 338 [2018-10-15 13:15:00,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6137, Invalid=14169, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:15:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-15 13:15:00,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 335. [2018-10-15 13:15:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-15 13:15:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-15 13:15:00,495 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 325 [2018-10-15 13:15:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:00,496 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-15 13:15:00,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:15:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-15 13:15:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-15 13:15:00,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:00,498 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:00,498 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:00,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1296200357, now seen corresponding path program 35 times [2018-10-15 13:15:00,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5425 backedges. 0 proven. 5425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:02,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:02,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:15:02,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:15:02,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:15:02,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1372, Invalid=4178, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:15:02,310 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 75 states. [2018-10-15 13:15:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:05,491 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-15 13:15:05,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 13:15:05,492 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 334 [2018-10-15 13:15:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:05,494 INFO L225 Difference]: With dead ends: 353 [2018-10-15 13:15:05,494 INFO L226 Difference]: Without dead ends: 347 [2018-10-15 13:15:05,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6492, Invalid=14970, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:15:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-15 13:15:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2018-10-15 13:15:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 13:15:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-10-15 13:15:05,500 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 334 [2018-10-15 13:15:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:05,500 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-10-15 13:15:05,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:15:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-10-15 13:15:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-15 13:15:05,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:05,503 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:05,503 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:05,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2075782705, now seen corresponding path program 36 times [2018-10-15 13:15:05,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5742 backedges. 0 proven. 5742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:07,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:07,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:15:07,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:15:07,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:15:07,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1447, Invalid=4405, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:15:07,474 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 77 states. [2018-10-15 13:15:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:10,717 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2018-10-15 13:15:10,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 13:15:10,718 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 343 [2018-10-15 13:15:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:10,720 INFO L225 Difference]: With dead ends: 362 [2018-10-15 13:15:10,720 INFO L226 Difference]: Without dead ends: 356 [2018-10-15 13:15:10,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6857, Invalid=15793, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:15:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-15 13:15:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 353. [2018-10-15 13:15:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-15 13:15:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-15 13:15:10,727 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 343 [2018-10-15 13:15:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:10,728 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-15 13:15:10,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:15:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-15 13:15:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 13:15:10,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:10,730 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:10,730 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:10,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash 837935589, now seen corresponding path program 37 times [2018-10-15 13:15:10,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6068 backedges. 0 proven. 6068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:12,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:12,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:15:12,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:15:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:15:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=4638, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:15:12,754 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 79 states. [2018-10-15 13:15:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:16,209 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-10-15 13:15:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 13:15:16,209 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 352 [2018-10-15 13:15:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:16,211 INFO L225 Difference]: With dead ends: 371 [2018-10-15 13:15:16,212 INFO L226 Difference]: Without dead ends: 365 [2018-10-15 13:15:16,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7232, Invalid=16638, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 13:15:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-15 13:15:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2018-10-15 13:15:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-15 13:15:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-15 13:15:16,216 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 352 [2018-10-15 13:15:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:16,217 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-15 13:15:16,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:15:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-15 13:15:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-15 13:15:16,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:16,219 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:16,219 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:16,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1591724687, now seen corresponding path program 38 times [2018-10-15 13:15:16,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6403 backedges. 0 proven. 6403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:18,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:18,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:15:18,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:15:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:15:18,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=4877, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:15:18,178 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 81 states. [2018-10-15 13:15:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:21,668 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-10-15 13:15:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 13:15:21,668 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 361 [2018-10-15 13:15:21,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:21,670 INFO L225 Difference]: With dead ends: 380 [2018-10-15 13:15:21,670 INFO L226 Difference]: Without dead ends: 374 [2018-10-15 13:15:21,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7617, Invalid=17505, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 13:15:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-15 13:15:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2018-10-15 13:15:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 13:15:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-15 13:15:21,677 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 361 [2018-10-15 13:15:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:21,677 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-15 13:15:21,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:15:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-15 13:15:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-15 13:15:21,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:21,679 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:21,680 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:21,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash 870056229, now seen corresponding path program 39 times [2018-10-15 13:15:21,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6747 backedges. 0 proven. 6747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:23,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:23,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:15:23,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:15:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:15:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=5122, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:15:23,789 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 83 states. [2018-10-15 13:15:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:27,638 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-10-15 13:15:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 13:15:27,639 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 370 [2018-10-15 13:15:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:27,641 INFO L225 Difference]: With dead ends: 389 [2018-10-15 13:15:27,642 INFO L226 Difference]: Without dead ends: 383 [2018-10-15 13:15:27,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8012, Invalid=18394, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 13:15:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-15 13:15:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-10-15 13:15:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 13:15:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-15 13:15:27,647 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 370 [2018-10-15 13:15:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:27,647 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-15 13:15:27,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:15:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-15 13:15:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 13:15:27,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:27,649 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:27,649 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:27,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:27,650 INFO L82 PathProgramCache]: Analyzing trace with hash -616246449, now seen corresponding path program 40 times [2018-10-15 13:15:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7100 backedges. 0 proven. 7100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:29,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:29,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:15:29,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:15:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:15:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5373, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:15:29,702 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 85 states. [2018-10-15 13:15:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:33,840 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-15 13:15:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 13:15:33,840 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 379 [2018-10-15 13:15:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:33,843 INFO L225 Difference]: With dead ends: 398 [2018-10-15 13:15:33,843 INFO L226 Difference]: Without dead ends: 392 [2018-10-15 13:15:33,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8417, Invalid=19305, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 13:15:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-10-15 13:15:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 389. [2018-10-15 13:15:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-15 13:15:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-15 13:15:33,848 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 379 [2018-10-15 13:15:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:33,848 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-15 13:15:33,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:15:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-15 13:15:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-15 13:15:33,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:33,850 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:33,850 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:33,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1538576485, now seen corresponding path program 41 times [2018-10-15 13:15:33,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7462 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:36,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:36,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:15:36,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:15:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:15:36,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1852, Invalid=5630, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:15:36,467 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 87 states. [2018-10-15 13:15:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:40,600 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-10-15 13:15:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 13:15:40,600 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 388 [2018-10-15 13:15:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:40,601 INFO L225 Difference]: With dead ends: 407 [2018-10-15 13:15:40,602 INFO L226 Difference]: Without dead ends: 401 [2018-10-15 13:15:40,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8832, Invalid=20238, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 13:15:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-15 13:15:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 398. [2018-10-15 13:15:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-15 13:15:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-10-15 13:15:40,608 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 388 [2018-10-15 13:15:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:40,609 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-10-15 13:15:40,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:15:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-10-15 13:15:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-15 13:15:40,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:40,611 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:40,611 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:40,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2067868687, now seen corresponding path program 42 times [2018-10-15 13:15:40,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 0 proven. 7833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:43,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:43,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:15:43,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:15:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:15:43,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1939, Invalid=5893, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:15:43,507 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 89 states. [2018-10-15 13:15:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:47,837 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2018-10-15 13:15:47,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 13:15:47,837 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 397 [2018-10-15 13:15:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:47,840 INFO L225 Difference]: With dead ends: 416 [2018-10-15 13:15:47,840 INFO L226 Difference]: Without dead ends: 410 [2018-10-15 13:15:47,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9257, Invalid=21193, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 13:15:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-15 13:15:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2018-10-15 13:15:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-15 13:15:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-10-15 13:15:47,846 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 397 [2018-10-15 13:15:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:47,847 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-10-15 13:15:47,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:15:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-10-15 13:15:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-15 13:15:47,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:47,849 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:47,850 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:47,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1831882661, now seen corresponding path program 43 times [2018-10-15 13:15:47,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8213 backedges. 0 proven. 8213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:50,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:50,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:15:50,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:15:50,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:15:50,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2028, Invalid=6162, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:15:50,451 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 91 states. [2018-10-15 13:15:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:54,937 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-15 13:15:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 13:15:54,937 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 406 [2018-10-15 13:15:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:54,939 INFO L225 Difference]: With dead ends: 425 [2018-10-15 13:15:54,939 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 13:15:54,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9692, Invalid=22170, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 13:15:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 13:15:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2018-10-15 13:15:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:15:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-10-15 13:15:54,945 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 406 [2018-10-15 13:15:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:54,946 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-10-15 13:15:54,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:15:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-10-15 13:15:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-15 13:15:54,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:54,948 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:15:54,948 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:54,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1705039055, now seen corresponding path program 44 times [2018-10-15 13:15:54,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8602 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:57,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:57,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:15:57,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:15:57,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:15:57,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2119, Invalid=6437, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:15:57,961 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 93 states. [2018-10-15 13:16:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:02,558 INFO L93 Difference]: Finished difference Result 434 states and 434 transitions. [2018-10-15 13:16:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 13:16:02,558 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 415 [2018-10-15 13:16:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:02,560 INFO L225 Difference]: With dead ends: 434 [2018-10-15 13:16:02,560 INFO L226 Difference]: Without dead ends: 428 [2018-10-15 13:16:02,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10137, Invalid=23169, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 13:16:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-15 13:16:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2018-10-15 13:16:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-15 13:16:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 425 transitions. [2018-10-15 13:16:02,565 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 425 transitions. Word has length 415 [2018-10-15 13:16:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:02,566 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 425 transitions. [2018-10-15 13:16:02,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:16:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 425 transitions. [2018-10-15 13:16:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-15 13:16:02,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:02,567 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:16:02,568 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:02,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 654474981, now seen corresponding path program 45 times [2018-10-15 13:16:02,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9000 backedges. 0 proven. 9000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:05,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:05,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:16:05,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:16:05,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:16:05,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=6718, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:16:05,196 INFO L87 Difference]: Start difference. First operand 425 states and 425 transitions. Second operand 95 states. [2018-10-15 13:16:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:09,873 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-10-15 13:16:09,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 13:16:09,874 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 424 [2018-10-15 13:16:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:09,876 INFO L225 Difference]: With dead ends: 443 [2018-10-15 13:16:09,876 INFO L226 Difference]: Without dead ends: 437 [2018-10-15 13:16:09,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10592, Invalid=24190, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 13:16:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-15 13:16:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2018-10-15 13:16:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 13:16:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 434 transitions. [2018-10-15 13:16:09,881 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 434 transitions. Word has length 424 [2018-10-15 13:16:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:09,882 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 434 transitions. [2018-10-15 13:16:09,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:16:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 434 transitions. [2018-10-15 13:16:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-15 13:16:09,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:09,883 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:16:09,884 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:09,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash 640667023, now seen corresponding path program 46 times [2018-10-15 13:16:09,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9407 backedges. 0 proven. 9407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:12,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:12,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 13:16:12,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 13:16:12,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 13:16:12,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=7005, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:16:12,760 INFO L87 Difference]: Start difference. First operand 434 states and 434 transitions. Second operand 97 states. [2018-10-15 13:16:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:18,025 INFO L93 Difference]: Finished difference Result 452 states and 452 transitions. [2018-10-15 13:16:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 13:16:18,025 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 433 [2018-10-15 13:16:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:18,028 INFO L225 Difference]: With dead ends: 452 [2018-10-15 13:16:18,028 INFO L226 Difference]: Without dead ends: 446 [2018-10-15 13:16:18,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11057, Invalid=25233, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 13:16:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-10-15 13:16:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2018-10-15 13:16:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-15 13:16:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-15 13:16:18,034 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 433 [2018-10-15 13:16:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:18,034 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-15 13:16:18,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 13:16:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-15 13:16:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-15 13:16:18,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:18,037 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:16:18,037 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:18,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:18,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2099290587, now seen corresponding path program 47 times [2018-10-15 13:16:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9823 backedges. 0 proven. 9823 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:20,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:20,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:16:20,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:16:20,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:16:20,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2404, Invalid=7298, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:16:20,963 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 99 states. [2018-10-15 13:16:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:26,349 INFO L93 Difference]: Finished difference Result 461 states and 461 transitions. [2018-10-15 13:16:26,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 13:16:26,349 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 442 [2018-10-15 13:16:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:26,352 INFO L225 Difference]: With dead ends: 461 [2018-10-15 13:16:26,352 INFO L226 Difference]: Without dead ends: 455 [2018-10-15 13:16:26,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11532, Invalid=26298, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 13:16:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-15 13:16:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 452. [2018-10-15 13:16:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-10-15 13:16:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 452 transitions. [2018-10-15 13:16:26,357 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 452 transitions. Word has length 442 [2018-10-15 13:16:26,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:26,357 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 452 transitions. [2018-10-15 13:16:26,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:16:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 452 transitions. [2018-10-15 13:16:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-10-15 13:16:26,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:26,359 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:16:26,359 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:26,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1840911951, now seen corresponding path program 48 times [2018-10-15 13:16:26,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10248 backedges. 0 proven. 10248 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:29,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:29,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 13:16:29,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 13:16:29,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 13:16:29,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2503, Invalid=7597, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:16:29,564 INFO L87 Difference]: Start difference. First operand 452 states and 452 transitions. Second operand 101 states. [2018-10-15 13:16:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:35,108 INFO L93 Difference]: Finished difference Result 470 states and 470 transitions. [2018-10-15 13:16:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 13:16:35,109 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 451 [2018-10-15 13:16:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:35,111 INFO L225 Difference]: With dead ends: 470 [2018-10-15 13:16:35,111 INFO L226 Difference]: Without dead ends: 464 [2018-10-15 13:16:35,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=12017, Invalid=27385, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 13:16:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-15 13:16:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2018-10-15 13:16:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-10-15 13:16:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 461 transitions. [2018-10-15 13:16:35,118 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 461 transitions. Word has length 451 [2018-10-15 13:16:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:35,118 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 461 transitions. [2018-10-15 13:16:35,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 13:16:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 461 transitions. [2018-10-15 13:16:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-10-15 13:16:35,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:35,121 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:16:35,121 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:35,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash -176493211, now seen corresponding path program 49 times [2018-10-15 13:16:35,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10682 backedges. 0 proven. 10682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:38,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:38,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 13:16:38,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 13:16:38,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 13:16:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2604, Invalid=7902, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:16:38,477 INFO L87 Difference]: Start difference. First operand 461 states and 461 transitions. Second operand 103 states. [2018-10-15 13:16:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:44,004 INFO L93 Difference]: Finished difference Result 479 states and 479 transitions. [2018-10-15 13:16:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-15 13:16:44,005 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 460 [2018-10-15 13:16:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:44,007 INFO L225 Difference]: With dead ends: 479 [2018-10-15 13:16:44,008 INFO L226 Difference]: Without dead ends: 473 [2018-10-15 13:16:44,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12512, Invalid=28494, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 13:16:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-10-15 13:16:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 470. [2018-10-15 13:16:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-15 13:16:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-15 13:16:44,015 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 460 [2018-10-15 13:16:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:44,015 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-15 13:16:44,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 13:16:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-15 13:16:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 13:16:44,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:44,018 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-15 13:16:44,018 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:44,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash -770986225, now seen corresponding path program 50 times [2018-10-15 13:16:44,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11125 backedges. 0 proven. 11125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:47,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:47,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 13:16:47,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 13:16:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 13:16:47,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2707, Invalid=8213, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:16:47,396 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 105 states. [2018-10-15 13:16:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:53,103 INFO L93 Difference]: Finished difference Result 488 states and 488 transitions. [2018-10-15 13:16:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 13:16:53,106 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 469 [2018-10-15 13:16:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:53,108 INFO L225 Difference]: With dead ends: 488 [2018-10-15 13:16:53,108 INFO L226 Difference]: Without dead ends: 482 [2018-10-15 13:16:53,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=13017, Invalid=29625, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 13:16:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-10-15 13:16:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 479. [2018-10-15 13:16:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-15 13:16:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-15 13:16:53,113 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 469 [2018-10-15 13:16:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:53,113 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-15 13:16:53,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 13:16:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-15 13:16:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-15 13:16:53,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:53,116 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:53,116 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:53,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1366741851, now seen corresponding path program 51 times [2018-10-15 13:16:53,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11577 backedges. 0 proven. 11577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:56,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:56,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 13:16:56,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 13:16:56,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 13:16:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2812, Invalid=8530, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:16:56,317 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 107 states. [2018-10-15 13:17:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:02,234 INFO L93 Difference]: Finished difference Result 497 states and 497 transitions. [2018-10-15 13:17:02,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-15 13:17:02,235 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 478 [2018-10-15 13:17:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:02,237 INFO L225 Difference]: With dead ends: 497 [2018-10-15 13:17:02,237 INFO L226 Difference]: Without dead ends: 491 [2018-10-15 13:17:02,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=13532, Invalid=30778, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 13:17:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-10-15 13:17:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 488. [2018-10-15 13:17:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-15 13:17:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 488 transitions. [2018-10-15 13:17:02,243 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 488 transitions. Word has length 478 [2018-10-15 13:17:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:02,243 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 488 transitions. [2018-10-15 13:17:02,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 13:17:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 488 transitions. [2018-10-15 13:17:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-15 13:17:02,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:02,245 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:02,245 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:02,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1913612337, now seen corresponding path program 52 times [2018-10-15 13:17:02,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12038 backedges. 0 proven. 12038 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:05,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:05,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 13:17:05,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 13:17:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 13:17:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2919, Invalid=8853, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 13:17:05,798 INFO L87 Difference]: Start difference. First operand 488 states and 488 transitions. Second operand 109 states. [2018-10-15 13:17:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:11,821 INFO L93 Difference]: Finished difference Result 506 states and 506 transitions. [2018-10-15 13:17:11,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 13:17:11,822 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 487 [2018-10-15 13:17:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:11,823 INFO L225 Difference]: With dead ends: 506 [2018-10-15 13:17:11,823 INFO L226 Difference]: Without dead ends: 500 [2018-10-15 13:17:11,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=14057, Invalid=31953, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 13:17:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-15 13:17:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 497. [2018-10-15 13:17:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-10-15 13:17:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 497 transitions. [2018-10-15 13:17:11,829 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 497 transitions. Word has length 487 [2018-10-15 13:17:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:11,829 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 497 transitions. [2018-10-15 13:17:11,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 13:17:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 497 transitions. [2018-10-15 13:17:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-15 13:17:11,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:11,831 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:11,832 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:11,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash -658629659, now seen corresponding path program 53 times [2018-10-15 13:17:11,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12508 backedges. 0 proven. 12508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:15,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:15,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 13:17:15,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 13:17:15,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 13:17:15,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3028, Invalid=9182, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:17:15,548 INFO L87 Difference]: Start difference. First operand 497 states and 497 transitions. Second operand 111 states. [2018-10-15 13:17:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:22,020 INFO L93 Difference]: Finished difference Result 515 states and 515 transitions. [2018-10-15 13:17:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 13:17:22,020 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 496 [2018-10-15 13:17:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:22,023 INFO L225 Difference]: With dead ends: 515 [2018-10-15 13:17:22,023 INFO L226 Difference]: Without dead ends: 509 [2018-10-15 13:17:22,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14592, Invalid=33150, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 13:17:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-15 13:17:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 506. [2018-10-15 13:17:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-10-15 13:17:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 506 transitions. [2018-10-15 13:17:22,029 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 506 transitions. Word has length 496 [2018-10-15 13:17:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:22,029 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 506 transitions. [2018-10-15 13:17:22,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 13:17:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 506 transitions. [2018-10-15 13:17:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-15 13:17:22,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:22,031 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:22,032 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:22,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1093980303, now seen corresponding path program 54 times [2018-10-15 13:17:22,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12987 backedges. 0 proven. 12987 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:25,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:25,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 13:17:25,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 13:17:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 13:17:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=9517, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 13:17:25,964 INFO L87 Difference]: Start difference. First operand 506 states and 506 transitions. Second operand 113 states. [2018-10-15 13:17:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:32,564 INFO L93 Difference]: Finished difference Result 524 states and 524 transitions. [2018-10-15 13:17:32,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 13:17:32,564 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 505 [2018-10-15 13:17:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:32,566 INFO L225 Difference]: With dead ends: 524 [2018-10-15 13:17:32,566 INFO L226 Difference]: Without dead ends: 518 [2018-10-15 13:17:32,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15137, Invalid=34369, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 13:17:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-10-15 13:17:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 515. [2018-10-15 13:17:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 13:17:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-15 13:17:32,571 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 505 [2018-10-15 13:17:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:32,571 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-15 13:17:32,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 13:17:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-15 13:17:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-15 13:17:32,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:32,574 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:32,574 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:32,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash -640828635, now seen corresponding path program 55 times [2018-10-15 13:17:32,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13475 backedges. 0 proven. 13475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:36,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:36,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 13:17:36,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 13:17:36,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 13:17:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=9858, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:17:36,518 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 115 states. [2018-10-15 13:17:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:43,072 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-15 13:17:43,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-15 13:17:43,072 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 514 [2018-10-15 13:17:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:43,075 INFO L225 Difference]: With dead ends: 533 [2018-10-15 13:17:43,076 INFO L226 Difference]: Without dead ends: 527 [2018-10-15 13:17:43,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15692, Invalid=35610, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 13:17:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-15 13:17:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 524. [2018-10-15 13:17:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-15 13:17:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 524 transitions. [2018-10-15 13:17:43,081 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 524 transitions. Word has length 514 [2018-10-15 13:17:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:43,081 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 524 transitions. [2018-10-15 13:17:43,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 13:17:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 524 transitions. [2018-10-15 13:17:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-10-15 13:17:43,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:43,084 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:43,084 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:43,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1331406513, now seen corresponding path program 56 times [2018-10-15 13:17:43,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13972 backedges. 0 proven. 13972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:47,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:47,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 13:17:47,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 13:17:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 13:17:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3367, Invalid=10205, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 13:17:47,108 INFO L87 Difference]: Start difference. First operand 524 states and 524 transitions. Second operand 117 states. [2018-10-15 13:17:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:54,240 INFO L93 Difference]: Finished difference Result 542 states and 542 transitions. [2018-10-15 13:17:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 13:17:54,240 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 523 [2018-10-15 13:17:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:54,243 INFO L225 Difference]: With dead ends: 542 [2018-10-15 13:17:54,243 INFO L226 Difference]: Without dead ends: 536 [2018-10-15 13:17:54,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16257, Invalid=36873, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 13:17:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-15 13:17:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2018-10-15 13:17:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-15 13:17:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 533 transitions. [2018-10-15 13:17:54,249 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 533 transitions. Word has length 523 [2018-10-15 13:17:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:54,249 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 533 transitions. [2018-10-15 13:17:54,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 13:17:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 533 transitions. [2018-10-15 13:17:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-10-15 13:17:54,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:54,251 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:54,252 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:54,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1838413211, now seen corresponding path program 57 times [2018-10-15 13:17:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14478 backedges. 0 proven. 14478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:58,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:58,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 13:17:58,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 13:17:58,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 13:17:58,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3484, Invalid=10558, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:17:58,175 INFO L87 Difference]: Start difference. First operand 533 states and 533 transitions. Second operand 119 states. [2018-10-15 13:18:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:05,306 INFO L93 Difference]: Finished difference Result 551 states and 551 transitions. [2018-10-15 13:18:05,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-15 13:18:05,307 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 532 [2018-10-15 13:18:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:05,310 INFO L225 Difference]: With dead ends: 551 [2018-10-15 13:18:05,310 INFO L226 Difference]: Without dead ends: 545 [2018-10-15 13:18:05,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16832, Invalid=38158, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 13:18:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-15 13:18:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 542. [2018-10-15 13:18:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-10-15 13:18:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 542 transitions. [2018-10-15 13:18:05,317 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 542 transitions. Word has length 532 [2018-10-15 13:18:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:05,317 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 542 transitions. [2018-10-15 13:18:05,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:18:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 542 transitions. [2018-10-15 13:18:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-10-15 13:18:05,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:05,319 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:05,320 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:05,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2046086641, now seen corresponding path program 58 times [2018-10-15 13:18:05,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14993 backedges. 0 proven. 14993 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:09,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:09,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:18:09,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:18:09,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:18:09,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3603, Invalid=10917, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:18:09,705 INFO L87 Difference]: Start difference. First operand 542 states and 542 transitions. Second operand 121 states. [2018-10-15 13:18:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:17,137 INFO L93 Difference]: Finished difference Result 560 states and 560 transitions. [2018-10-15 13:18:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 13:18:17,137 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 541 [2018-10-15 13:18:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:17,139 INFO L225 Difference]: With dead ends: 560 [2018-10-15 13:18:17,139 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 13:18:17,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=17417, Invalid=39465, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:18:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 13:18:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2018-10-15 13:18:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-10-15 13:18:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 551 transitions. [2018-10-15 13:18:17,145 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 551 transitions. Word has length 541 [2018-10-15 13:18:17,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:17,146 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 551 transitions. [2018-10-15 13:18:17,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:18:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 551 transitions. [2018-10-15 13:18:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-10-15 13:18:17,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:17,148 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:17,148 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:17,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1639118427, now seen corresponding path program 59 times [2018-10-15 13:18:17,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15517 backedges. 0 proven. 15517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:21,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:21,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:18:21,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:18:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:18:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3724, Invalid=11282, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:18:21,579 INFO L87 Difference]: Start difference. First operand 551 states and 551 transitions. Second operand 123 states. [2018-10-15 13:18:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:29,391 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2018-10-15 13:18:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-15 13:18:29,392 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 550 [2018-10-15 13:18:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:29,395 INFO L225 Difference]: With dead ends: 569 [2018-10-15 13:18:29,395 INFO L226 Difference]: Without dead ends: 563 [2018-10-15 13:18:29,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=18012, Invalid=40794, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:18:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-10-15 13:18:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 560. [2018-10-15 13:18:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 13:18:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 560 transitions. [2018-10-15 13:18:29,401 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 560 transitions. Word has length 550 [2018-10-15 13:18:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:29,402 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 560 transitions. [2018-10-15 13:18:29,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:18:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 560 transitions. [2018-10-15 13:18:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 13:18:29,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:29,404 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:29,404 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:29,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash 271932111, now seen corresponding path program 60 times [2018-10-15 13:18:29,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16050 backedges. 0 proven. 16050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:33,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:33,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:18:33,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:18:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:18:33,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3847, Invalid=11653, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:18:33,925 INFO L87 Difference]: Start difference. First operand 560 states and 560 transitions. Second operand 125 states. [2018-10-15 13:18:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:42,048 INFO L93 Difference]: Finished difference Result 578 states and 578 transitions. [2018-10-15 13:18:42,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 13:18:42,048 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 559 [2018-10-15 13:18:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:42,051 INFO L225 Difference]: With dead ends: 578 [2018-10-15 13:18:42,051 INFO L226 Difference]: Without dead ends: 572 [2018-10-15 13:18:42,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11158 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=18617, Invalid=42145, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:18:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-10-15 13:18:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 569. [2018-10-15 13:18:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-10-15 13:18:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 569 transitions. [2018-10-15 13:18:42,056 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 569 transitions. Word has length 559 [2018-10-15 13:18:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:42,057 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 569 transitions. [2018-10-15 13:18:42,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:18:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 569 transitions. [2018-10-15 13:18:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-15 13:18:42,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:42,059 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:42,059 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:42,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:42,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1809532699, now seen corresponding path program 61 times [2018-10-15 13:18:42,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16592 backedges. 0 proven. 16592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:46,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:46,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:18:46,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:18:46,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:18:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3972, Invalid=12030, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:18:46,697 INFO L87 Difference]: Start difference. First operand 569 states and 569 transitions. Second operand 127 states. [2018-10-15 13:18:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:54,702 INFO L93 Difference]: Finished difference Result 587 states and 587 transitions. [2018-10-15 13:18:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 13:18:54,703 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 568 [2018-10-15 13:18:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:54,705 INFO L225 Difference]: With dead ends: 587 [2018-10-15 13:18:54,705 INFO L226 Difference]: Without dead ends: 581 [2018-10-15 13:18:54,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11527 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=19232, Invalid=43518, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:18:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-10-15 13:18:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 578. [2018-10-15 13:18:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-10-15 13:18:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 578 transitions. [2018-10-15 13:18:54,711 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 578 transitions. Word has length 568 [2018-10-15 13:18:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:54,711 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 578 transitions. [2018-10-15 13:18:54,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:18:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 578 transitions. [2018-10-15 13:18:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-10-15 13:18:54,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:54,714 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:54,714 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:54,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:54,715 INFO L82 PathProgramCache]: Analyzing trace with hash 49206159, now seen corresponding path program 62 times [2018-10-15 13:18:54,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17143 backedges. 0 proven. 17143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:59,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:59,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:18:59,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:18:59,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:18:59,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=12413, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:18:59,611 INFO L87 Difference]: Start difference. First operand 578 states and 578 transitions. Second operand 129 states. [2018-10-15 13:19:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:08,134 INFO L93 Difference]: Finished difference Result 596 states and 596 transitions. [2018-10-15 13:19:08,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 13:19:08,134 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 577 [2018-10-15 13:19:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:08,136 INFO L225 Difference]: With dead ends: 596 [2018-10-15 13:19:08,136 INFO L226 Difference]: Without dead ends: 590 [2018-10-15 13:19:08,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11902 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=19857, Invalid=44913, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:19:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-15 13:19:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 587. [2018-10-15 13:19:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-10-15 13:19:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 587 transitions. [2018-10-15 13:19:08,142 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 587 transitions. Word has length 577 [2018-10-15 13:19:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:08,143 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 587 transitions. [2018-10-15 13:19:08,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:19:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 587 transitions. [2018-10-15 13:19:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-10-15 13:19:08,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:08,145 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:08,145 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:08,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1168578597, now seen corresponding path program 63 times [2018-10-15 13:19:08,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17703 backedges. 0 proven. 17703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:13,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:13,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:19:13,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:19:13,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:19:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4228, Invalid=12802, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:19:13,099 INFO L87 Difference]: Start difference. First operand 587 states and 587 transitions. Second operand 131 states. [2018-10-15 13:19:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:22,007 INFO L93 Difference]: Finished difference Result 605 states and 605 transitions. [2018-10-15 13:19:22,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-15 13:19:22,008 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 586 [2018-10-15 13:19:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:22,011 INFO L225 Difference]: With dead ends: 605 [2018-10-15 13:19:22,011 INFO L226 Difference]: Without dead ends: 599 [2018-10-15 13:19:22,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12283 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20492, Invalid=46330, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:19:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-15 13:19:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2018-10-15 13:19:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-10-15 13:19:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 596 transitions. [2018-10-15 13:19:22,018 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 596 transitions. Word has length 586 [2018-10-15 13:19:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:22,018 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 596 transitions. [2018-10-15 13:19:22,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:19:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 596 transitions. [2018-10-15 13:19:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-10-15 13:19:22,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:22,022 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:22,022 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:22,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:22,022 INFO L82 PathProgramCache]: Analyzing trace with hash 922983503, now seen corresponding path program 64 times [2018-10-15 13:19:22,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18272 backedges. 0 proven. 18272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:27,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:27,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:19:27,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:19:27,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:19:27,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4359, Invalid=13197, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:19:27,173 INFO L87 Difference]: Start difference. First operand 596 states and 596 transitions. Second operand 133 states. [2018-10-15 13:19:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:36,109 INFO L93 Difference]: Finished difference Result 614 states and 614 transitions. [2018-10-15 13:19:36,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 13:19:36,109 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 595 [2018-10-15 13:19:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:36,112 INFO L225 Difference]: With dead ends: 614 [2018-10-15 13:19:36,112 INFO L226 Difference]: Without dead ends: 608 [2018-10-15 13:19:36,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12670 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=21137, Invalid=47769, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:19:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-15 13:19:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2018-10-15 13:19:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-15 13:19:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 605 transitions. [2018-10-15 13:19:36,118 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 605 transitions. Word has length 595 [2018-10-15 13:19:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:36,118 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 605 transitions. [2018-10-15 13:19:36,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:19:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 605 transitions. [2018-10-15 13:19:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-10-15 13:19:36,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:36,121 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:36,121 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:36,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -7854235, now seen corresponding path program 65 times [2018-10-15 13:19:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18850 backedges. 0 proven. 18850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:41,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:41,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:19:41,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:19:41,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:19:41,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4492, Invalid=13598, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:19:41,142 INFO L87 Difference]: Start difference. First operand 605 states and 605 transitions. Second operand 135 states. [2018-10-15 13:19:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:50,560 INFO L93 Difference]: Finished difference Result 623 states and 623 transitions. [2018-10-15 13:19:50,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-15 13:19:50,560 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 604 [2018-10-15 13:19:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:50,563 INFO L225 Difference]: With dead ends: 623 [2018-10-15 13:19:50,563 INFO L226 Difference]: Without dead ends: 617 [2018-10-15 13:19:50,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13063 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=21792, Invalid=49230, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:19:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-15 13:19:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2018-10-15 13:19:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-10-15 13:19:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 614 transitions. [2018-10-15 13:19:50,569 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 614 transitions. Word has length 604 [2018-10-15 13:19:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:50,570 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 614 transitions. [2018-10-15 13:19:50,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:19:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 614 transitions. [2018-10-15 13:19:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-10-15 13:19:50,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:50,573 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:50,573 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:50,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:50,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1782560015, now seen corresponding path program 66 times [2018-10-15 13:19:50,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19437 backedges. 0 proven. 19437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:55,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:55,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:19:55,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:19:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:19:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4627, Invalid=14005, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:19:55,942 INFO L87 Difference]: Start difference. First operand 614 states and 614 transitions. Second operand 137 states. [2018-10-15 13:20:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:05,363 INFO L93 Difference]: Finished difference Result 632 states and 632 transitions. [2018-10-15 13:20:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 13:20:05,364 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 613 [2018-10-15 13:20:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:05,367 INFO L225 Difference]: With dead ends: 632 [2018-10-15 13:20:05,367 INFO L226 Difference]: Without dead ends: 626 [2018-10-15 13:20:05,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13462 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=22457, Invalid=50713, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:20:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-10-15 13:20:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 623. [2018-10-15 13:20:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-15 13:20:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 623 transitions. [2018-10-15 13:20:05,373 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 623 transitions. Word has length 613 [2018-10-15 13:20:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:05,373 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 623 transitions. [2018-10-15 13:20:05,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:20:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 623 transitions. [2018-10-15 13:20:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-15 13:20:05,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:05,376 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:05,376 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:05,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash -914626907, now seen corresponding path program 67 times [2018-10-15 13:20:05,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 20033 backedges. 0 proven. 20033 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:10,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:10,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:20:10,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:20:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:20:10,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4764, Invalid=14418, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:20:10,987 INFO L87 Difference]: Start difference. First operand 623 states and 623 transitions. Second operand 139 states. [2018-10-15 13:20:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:21,134 INFO L93 Difference]: Finished difference Result 641 states and 641 transitions. [2018-10-15 13:20:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 13:20:21,134 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 622 [2018-10-15 13:20:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:21,137 INFO L225 Difference]: With dead ends: 641 [2018-10-15 13:20:21,138 INFO L226 Difference]: Without dead ends: 635 [2018-10-15 13:20:21,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13867 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23132, Invalid=52218, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:20:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-10-15 13:20:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2018-10-15 13:20:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-10-15 13:20:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 632 transitions. [2018-10-15 13:20:21,145 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 632 transitions. Word has length 622 [2018-10-15 13:20:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:21,145 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 632 transitions. [2018-10-15 13:20:21,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:20:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 632 transitions. [2018-10-15 13:20:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2018-10-15 13:20:21,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:21,148 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:21,148 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:21,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash -9495089, now seen corresponding path program 68 times [2018-10-15 13:20:21,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 20638 backedges. 0 proven. 20638 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:26,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:26,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:20:26,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:20:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:20:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4903, Invalid=14837, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:20:26,804 INFO L87 Difference]: Start difference. First operand 632 states and 632 transitions. Second operand 141 states. [2018-10-15 13:20:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:36,784 INFO L93 Difference]: Finished difference Result 650 states and 650 transitions. [2018-10-15 13:20:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 13:20:36,785 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 631 [2018-10-15 13:20:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:36,788 INFO L225 Difference]: With dead ends: 650 [2018-10-15 13:20:36,788 INFO L226 Difference]: Without dead ends: 644 [2018-10-15 13:20:36,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14278 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23817, Invalid=53745, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:20:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-10-15 13:20:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 641. [2018-10-15 13:20:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-10-15 13:20:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 641 transitions. [2018-10-15 13:20:36,795 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 641 transitions. Word has length 631 [2018-10-15 13:20:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:36,795 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 641 transitions. [2018-10-15 13:20:36,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:20:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 641 transitions. [2018-10-15 13:20:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-10-15 13:20:36,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:36,798 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:36,798 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:36,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:36,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1506388507, now seen corresponding path program 69 times [2018-10-15 13:20:36,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 21252 backedges. 0 proven. 21252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:20:42,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:20:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:20:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5044, Invalid=15262, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:20:42,484 INFO L87 Difference]: Start difference. First operand 641 states and 641 transitions. Second operand 143 states. [2018-10-15 13:20:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:52,217 INFO L93 Difference]: Finished difference Result 659 states and 659 transitions. [2018-10-15 13:20:52,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-15 13:20:52,218 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 640 [2018-10-15 13:20:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:52,221 INFO L225 Difference]: With dead ends: 659 [2018-10-15 13:20:52,221 INFO L226 Difference]: Without dead ends: 653 [2018-10-15 13:20:52,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14695 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=24512, Invalid=55294, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:20:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-15 13:20:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2018-10-15 13:20:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-10-15 13:20:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 650 transitions. [2018-10-15 13:20:52,227 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 650 transitions. Word has length 640 [2018-10-15 13:20:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:52,228 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 650 transitions. [2018-10-15 13:20:52,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:20:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 650 transitions. [2018-10-15 13:20:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 13:20:52,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:52,231 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:52,231 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:52,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:52,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1101146481, now seen corresponding path program 70 times [2018-10-15 13:20:52,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21875 backedges. 0 proven. 21875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:57,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:57,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:20:57,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:20:57,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:20:57,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5187, Invalid=15693, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:20:57,917 INFO L87 Difference]: Start difference. First operand 650 states and 650 transitions. Second operand 145 states. [2018-10-15 13:21:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:07,997 INFO L93 Difference]: Finished difference Result 668 states and 668 transitions. [2018-10-15 13:21:07,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 13:21:07,997 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 649 [2018-10-15 13:21:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:08,001 INFO L225 Difference]: With dead ends: 668 [2018-10-15 13:21:08,001 INFO L226 Difference]: Without dead ends: 662 [2018-10-15 13:21:08,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15118 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=25217, Invalid=56865, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:21:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-15 13:21:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 659. [2018-10-15 13:21:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-10-15 13:21:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 659 transitions. [2018-10-15 13:21:08,007 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 659 transitions. Word has length 649 [2018-10-15 13:21:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:08,008 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 659 transitions. [2018-10-15 13:21:08,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:21:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 659 transitions. [2018-10-15 13:21:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2018-10-15 13:21:08,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:08,012 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:08,012 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:08,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash -747932379, now seen corresponding path program 71 times [2018-10-15 13:21:08,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 22507 backedges. 0 proven. 22507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:13,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:13,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:21:13,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:21:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:21:13,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5332, Invalid=16130, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:21:13,826 INFO L87 Difference]: Start difference. First operand 659 states and 659 transitions. Second operand 147 states. [2018-10-15 13:21:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:24,104 INFO L93 Difference]: Finished difference Result 677 states and 677 transitions. [2018-10-15 13:21:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-10-15 13:21:24,104 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 658 [2018-10-15 13:21:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:24,108 INFO L225 Difference]: With dead ends: 677 [2018-10-15 13:21:24,108 INFO L226 Difference]: Without dead ends: 671 [2018-10-15 13:21:24,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15547 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=25932, Invalid=58458, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:21:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-10-15 13:21:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 668. [2018-10-15 13:21:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-10-15 13:21:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 668 transitions. [2018-10-15 13:21:24,114 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 668 transitions. Word has length 658 [2018-10-15 13:21:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:24,115 INFO L481 AbstractCegarLoop]: Abstraction has 668 states and 668 transitions. [2018-10-15 13:21:24,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:21:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 668 transitions. [2018-10-15 13:21:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-10-15 13:21:24,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:24,118 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:24,118 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:24,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:24,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1814569137, now seen corresponding path program 72 times [2018-10-15 13:21:24,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 23148 backedges. 0 proven. 23148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:30,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:30,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 13:21:30,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 13:21:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 13:21:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5479, Invalid=16573, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:21:30,062 INFO L87 Difference]: Start difference. First operand 668 states and 668 transitions. Second operand 149 states. [2018-10-15 13:21:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:40,565 INFO L93 Difference]: Finished difference Result 686 states and 686 transitions. [2018-10-15 13:21:40,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-15 13:21:40,565 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 667 [2018-10-15 13:21:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:40,567 INFO L225 Difference]: With dead ends: 686 [2018-10-15 13:21:40,567 INFO L226 Difference]: Without dead ends: 680 [2018-10-15 13:21:40,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15982 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=26657, Invalid=60073, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 13:21:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-10-15 13:21:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 677. [2018-10-15 13:21:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-10-15 13:21:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 677 transitions. [2018-10-15 13:21:40,574 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 677 transitions. Word has length 667 [2018-10-15 13:21:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:40,574 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 677 transitions. [2018-10-15 13:21:40,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 13:21:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 677 transitions. [2018-10-15 13:21:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-10-15 13:21:40,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:40,578 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:40,578 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:40,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash 164578405, now seen corresponding path program 73 times [2018-10-15 13:21:40,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 23798 backedges. 0 proven. 23798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:46,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:46,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-10-15 13:21:46,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-15 13:21:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-15 13:21:46,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5628, Invalid=17022, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:21:46,704 INFO L87 Difference]: Start difference. First operand 677 states and 677 transitions. Second operand 151 states. [2018-10-15 13:21:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:57,382 INFO L93 Difference]: Finished difference Result 695 states and 695 transitions. [2018-10-15 13:21:57,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-10-15 13:21:57,383 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 676 [2018-10-15 13:21:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:57,385 INFO L225 Difference]: With dead ends: 695 [2018-10-15 13:21:57,385 INFO L226 Difference]: Without dead ends: 689 [2018-10-15 13:21:57,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16423 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=27392, Invalid=61710, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 13:21:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-10-15 13:21:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 686. [2018-10-15 13:21:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-10-15 13:21:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 686 transitions. [2018-10-15 13:21:57,391 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 686 transitions. Word has length 676 [2018-10-15 13:21:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:57,391 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 686 transitions. [2018-10-15 13:21:57,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-15 13:21:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 686 transitions. [2018-10-15 13:21:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2018-10-15 13:21:57,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:57,395 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:57,395 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:57,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1370044431, now seen corresponding path program 74 times [2018-10-15 13:21:57,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat