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/seq_true-unreach-call_true-termination.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:12:15,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:12:15,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:12:15,047 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:12:15,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:12:15,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:12:15,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:12:15,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:12:15,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:12:15,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:12:15,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:12:15,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:12:15,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:12:15,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:12:15,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:12:15,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:12:15,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:12:15,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:12:15,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:12:15,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:12:15,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:12:15,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:12:15,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:12:15,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:12:15,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:12:15,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:12:15,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:12:15,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:12:15,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:12:15,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:12:15,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:12:15,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:12:15,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:12:15,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:12:15,105 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:12:15,106 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:12:15,107 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:12:15,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:12:15,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:12:15,137 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:12:15,137 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:12:15,137 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:12:15,137 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:12:15,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:12:15,138 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:12:15,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:12:15,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:12:15,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:12:15,139 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:12:15,139 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:12:15,141 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:12:15,141 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:12:15,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:12:15,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:12:15,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:12:15,213 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:12:15,214 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:12:15,214 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/seq_true-unreach-call_true-termination.i_7.bpl [2018-10-15 13:12:15,215 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/seq_true-unreach-call_true-termination.i_7.bpl' [2018-10-15 13:12:15,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:12:15,268 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:12:15,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:12:15,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:12:15,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:12:15,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (1/1) ... [2018-10-15 13:12:15,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (1/1) ... [2018-10-15 13:12:15,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (1/1) ... [2018-10-15 13:12:15,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (1/1) ... [2018-10-15 13:12:15,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (1/1) ... [2018-10-15 13:12:15,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (1/1) ... [2018-10-15 13:12:15,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (1/1) ... [2018-10-15 13:12:15,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:12:15,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:12:15,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:12:15,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:12:15,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (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:12:15,397 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:12:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:12:15,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:12:15,782 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:12:15,782 INFO L202 PluginConnector]: Adding new model seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:15 BoogieIcfgContainer [2018-10-15 13:12:15,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:12:15,783 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:12:15,783 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:12:15,784 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:12:15,789 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:15" (1/1) ... [2018-10-15 13:12:15,797 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:12:15,816 INFO L202 PluginConnector]: Adding new model seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:12:15 BasicIcfg [2018-10-15 13:12:15,817 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:12:15,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:12:15,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:12:15,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:12:15,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:15" (1/3) ... [2018-10-15 13:12:15,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7333069a and model type seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:12:15, skipping insertion in model container [2018-10-15 13:12:15,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:15" (2/3) ... [2018-10-15 13:12:15,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7333069a and model type seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:12:15, skipping insertion in model container [2018-10-15 13:12:15,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:12:15" (3/3) ... [2018-10-15 13:12:15,826 INFO L112 eAbstractionObserver]: Analyzing ICFG seq_true-unreach-call_true-termination.i_7.bplleft_unchanged_by_heapseparator [2018-10-15 13:12:15,838 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:12:15,852 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:12:15,872 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:12:15,902 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:12:15,903 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:12:15,903 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:12:15,904 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:12:15,904 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:12:15,904 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:12:15,904 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:12:15,904 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:12:15,905 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:12:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-15 13:12:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 13:12:15,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:15,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:15,946 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:15,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash -654468750, now seen corresponding path program 1 times [2018-10-15 13:12:16,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:16,222 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:12:16,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:12:16,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 13:12:16,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:12:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:12:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:12:16,247 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 7 states. [2018-10-15 13:12:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:16,772 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-10-15 13:12:16,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:12:16,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-15 13:12:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:16,786 INFO L225 Difference]: With dead ends: 44 [2018-10-15 13:12:16,787 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 13:12:16,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:12:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 13:12:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-10-15 13:12:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 13:12:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-10-15 13:12:16,829 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 24 [2018-10-15 13:12:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:16,830 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-10-15 13:12:16,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:12:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-10-15 13:12:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 13:12:16,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:16,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:16,832 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:16,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1380761834, now seen corresponding path program 1 times [2018-10-15 13:12:16,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:16,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:12:16,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 13:12:17,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:12:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:12:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:12:17,001 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 7 states. [2018-10-15 13:12:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:17,243 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-10-15 13:12:17,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:12:17,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-10-15 13:12:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:17,246 INFO L225 Difference]: With dead ends: 57 [2018-10-15 13:12:17,247 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 13:12:17,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:12:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 13:12:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-10-15 13:12:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 13:12:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-15 13:12:17,255 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 31 [2018-10-15 13:12:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:17,256 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-15 13:12:17,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:12:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-15 13:12:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 13:12:17,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:17,258 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:17,259 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:17,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:17,259 INFO L82 PathProgramCache]: Analyzing trace with hash 14854771, now seen corresponding path program 1 times [2018-10-15 13:12:17,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:17,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:17,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:12:17,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:12:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:12:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:12:17,538 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 11 states. [2018-10-15 13:12:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:18,286 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-10-15 13:12:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:12:18,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-10-15 13:12:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:18,289 INFO L225 Difference]: With dead ends: 67 [2018-10-15 13:12:18,289 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 13:12:18,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:12:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 13:12:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-10-15 13:12:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 13:12:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-10-15 13:12:18,296 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 42 [2018-10-15 13:12:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:18,297 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-10-15 13:12:18,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:12:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-10-15 13:12:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 13:12:18,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:18,298 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:18,299 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:18,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:18,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1053563925, now seen corresponding path program 2 times [2018-10-15 13:12:18,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:18,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:18,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:12:18,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:12:18,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:12:18,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:12:18,564 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 12 states. [2018-10-15 13:12:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:18,995 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-10-15 13:12:19,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:12:19,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-10-15 13:12:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:19,004 INFO L225 Difference]: With dead ends: 74 [2018-10-15 13:12:19,004 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 13:12:19,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:12:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 13:12:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-10-15 13:12:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:12:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-10-15 13:12:19,012 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 49 [2018-10-15 13:12:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:19,013 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-10-15 13:12:19,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:12:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-10-15 13:12:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:12:19,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:19,015 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:19,015 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:19,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1558793426, now seen corresponding path program 3 times [2018-10-15 13:12:19,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:19,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:19,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:12:19,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:12:19,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:12:19,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:12:19,489 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 15 states. [2018-10-15 13:12:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:20,019 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-10-15 13:12:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:12:20,020 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-10-15 13:12:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:20,022 INFO L225 Difference]: With dead ends: 96 [2018-10-15 13:12:20,022 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 13:12:20,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:12:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 13:12:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-15 13:12:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-15 13:12:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-10-15 13:12:20,029 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 60 [2018-10-15 13:12:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:20,030 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-10-15 13:12:20,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:12:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-10-15 13:12:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 13:12:20,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:20,032 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:20,032 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:20,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1654397002, now seen corresponding path program 4 times [2018-10-15 13:12:20,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:20,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:20,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:12:20,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:12:20,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:12:20,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:12:20,276 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2018-10-15 13:12:20,736 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-10-15 13:12:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:21,002 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-10-15 13:12:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:12:21,003 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-10-15 13:12:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:21,005 INFO L225 Difference]: With dead ends: 92 [2018-10-15 13:12:21,006 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 13:12:21,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:12:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 13:12:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2018-10-15 13:12:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 13:12:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-10-15 13:12:21,014 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 67 [2018-10-15 13:12:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:21,015 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-10-15 13:12:21,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:12:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-10-15 13:12:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 13:12:21,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:21,017 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:21,019 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:21,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash 990181139, now seen corresponding path program 5 times [2018-10-15 13:12:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:21,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:21,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:12:21,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:12:21,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:12:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:12:21,389 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 19 states. [2018-10-15 13:12:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:22,160 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-10-15 13:12:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:12:22,160 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-10-15 13:12:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:22,163 INFO L225 Difference]: With dead ends: 125 [2018-10-15 13:12:22,163 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 13:12:22,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=1118, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:12:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 13:12:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-10-15 13:12:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 13:12:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-10-15 13:12:22,171 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 78 [2018-10-15 13:12:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:22,171 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-10-15 13:12:22,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:12:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-10-15 13:12:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 13:12:22,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:22,173 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:22,174 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:22,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2073613451, now seen corresponding path program 6 times [2018-10-15 13:12:22,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 46 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:22,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:22,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:12:22,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:12:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:12:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:12:22,476 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 18 states. [2018-10-15 13:12:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:23,058 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2018-10-15 13:12:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:12:23,058 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 85 [2018-10-15 13:12:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:23,061 INFO L225 Difference]: With dead ends: 110 [2018-10-15 13:12:23,061 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 13:12:23,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:12:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 13:12:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2018-10-15 13:12:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 13:12:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-10-15 13:12:23,070 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 85 [2018-10-15 13:12:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:23,071 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-10-15 13:12:23,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:12:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-10-15 13:12:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 13:12:23,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:23,073 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:23,073 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:23,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1444263986, now seen corresponding path program 7 times [2018-10-15 13:12:23,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 86 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:23,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:23,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:12:23,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:12:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:12:23,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:12:23,404 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 23 states. [2018-10-15 13:12:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:24,059 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2018-10-15 13:12:24,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:12:24,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2018-10-15 13:12:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:24,061 INFO L225 Difference]: With dead ends: 154 [2018-10-15 13:12:24,062 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 13:12:24,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=419, Invalid=1743, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:12:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 13:12:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-15 13:12:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 13:12:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-10-15 13:12:24,069 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 96 [2018-10-15 13:12:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:24,070 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-10-15 13:12:24,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:12:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-10-15 13:12:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 13:12:24,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:24,072 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:24,072 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:24,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash 908732330, now seen corresponding path program 8 times [2018-10-15 13:12:24,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 75 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:24,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:24,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:12:24,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:12:24,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:12:24,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:12:24,378 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2018-10-15 13:12:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:25,186 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2018-10-15 13:12:25,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:12:25,186 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2018-10-15 13:12:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:25,188 INFO L225 Difference]: With dead ends: 128 [2018-10-15 13:12:25,188 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 13:12:25,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=504, Invalid=1946, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:12:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 13:12:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2018-10-15 13:12:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 13:12:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-10-15 13:12:25,200 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 103 [2018-10-15 13:12:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:25,201 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-10-15 13:12:25,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:12:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-10-15 13:12:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 13:12:25,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:25,203 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:25,203 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:25,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:25,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1912239181, now seen corresponding path program 9 times [2018-10-15 13:12:25,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 135 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:25,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:25,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:12:25,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:12:25,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:12:25,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:12:25,629 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 27 states. [2018-10-15 13:12:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:26,845 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-10-15 13:12:26,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:12:26,845 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 114 [2018-10-15 13:12:26,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:26,847 INFO L225 Difference]: With dead ends: 183 [2018-10-15 13:12:26,847 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 13:12:26,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=574, Invalid=2506, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:12:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 13:12:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-15 13:12:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 13:12:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-10-15 13:12:26,855 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 114 [2018-10-15 13:12:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:26,855 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-10-15 13:12:26,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:12:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-10-15 13:12:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 13:12:26,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:26,857 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:26,858 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:26,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1499073835, now seen corresponding path program 10 times [2018-10-15 13:12:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 111 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:27,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:27,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 13:12:27,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 13:12:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 13:12:27,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:12:27,243 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 24 states. [2018-10-15 13:12:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:28,070 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2018-10-15 13:12:28,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:12:28,071 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 121 [2018-10-15 13:12:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:28,072 INFO L225 Difference]: With dead ends: 146 [2018-10-15 13:12:28,073 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 13:12:28,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=687, Invalid=2735, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:12:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 13:12:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2018-10-15 13:12:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 13:12:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-10-15 13:12:28,080 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 121 [2018-10-15 13:12:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:28,080 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-10-15 13:12:28,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 13:12:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-10-15 13:12:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 13:12:28,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:28,082 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:28,083 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:28,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1326916718, now seen corresponding path program 11 times [2018-10-15 13:12:28,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 195 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:28,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:28,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:12:28,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:12:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:12:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:12:28,539 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 31 states. [2018-10-15 13:12:29,257 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-15 13:12:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:29,837 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-10-15 13:12:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:12:29,837 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 132 [2018-10-15 13:12:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:29,839 INFO L225 Difference]: With dead ends: 212 [2018-10-15 13:12:29,839 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 13:12:29,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=753, Invalid=3407, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:12:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 13:12:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-15 13:12:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 13:12:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-10-15 13:12:29,844 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 132 [2018-10-15 13:12:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:29,845 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-10-15 13:12:29,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:12:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-10-15 13:12:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 13:12:29,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:29,847 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:29,847 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:29,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 308080394, now seen corresponding path program 12 times [2018-10-15 13:12:29,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 154 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:30,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:30,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:12:30,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:12:30,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:12:30,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:12:30,220 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 27 states. [2018-10-15 13:12:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:31,786 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2018-10-15 13:12:31,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:12:31,787 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 139 [2018-10-15 13:12:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:31,788 INFO L225 Difference]: With dead ends: 164 [2018-10-15 13:12:31,789 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 13:12:31,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=898, Invalid=3658, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:12:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 13:12:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2018-10-15 13:12:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 13:12:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-10-15 13:12:31,795 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 139 [2018-10-15 13:12:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:31,796 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-10-15 13:12:31,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:12:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-10-15 13:12:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 13:12:31,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:31,798 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:31,798 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:31,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2025744467, now seen corresponding path program 13 times [2018-10-15 13:12:31,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 266 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:32,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:32,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:12:32,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:12:32,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:12:32,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:12:32,326 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 35 states. [2018-10-15 13:12:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:33,672 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2018-10-15 13:12:33,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:12:33,672 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 150 [2018-10-15 13:12:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:33,674 INFO L225 Difference]: With dead ends: 241 [2018-10-15 13:12:33,674 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 13:12:33,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=956, Invalid=4446, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:12:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 13:12:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-10-15 13:12:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 13:12:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-10-15 13:12:33,680 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 150 [2018-10-15 13:12:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:33,680 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-10-15 13:12:33,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:12:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-10-15 13:12:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:12:33,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:33,681 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:33,682 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:33,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:33,682 INFO L82 PathProgramCache]: Analyzing trace with hash -229536309, now seen corresponding path program 14 times [2018-10-15 13:12:33,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 204 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:34,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:34,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 13:12:34,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 13:12:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 13:12:34,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:12:34,969 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 30 states. [2018-10-15 13:12:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:36,017 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-10-15 13:12:36,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:12:36,017 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 157 [2018-10-15 13:12:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:36,019 INFO L225 Difference]: With dead ends: 182 [2018-10-15 13:12:36,019 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 13:12:36,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1137, Invalid=4715, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:12:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 13:12:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-10-15 13:12:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 13:12:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-10-15 13:12:36,026 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 157 [2018-10-15 13:12:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:36,026 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-10-15 13:12:36,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 13:12:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-10-15 13:12:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 13:12:36,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:36,028 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:36,028 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:36,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:36,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1229502194, now seen corresponding path program 15 times [2018-10-15 13:12:36,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 348 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:36,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:36,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:12:36,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:12:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:12:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:12:36,949 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 39 states. [2018-10-15 13:12:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:38,507 INFO L93 Difference]: Finished difference Result 270 states and 271 transitions. [2018-10-15 13:12:38,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:12:38,508 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 168 [2018-10-15 13:12:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:38,509 INFO L225 Difference]: With dead ends: 270 [2018-10-15 13:12:38,509 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 13:12:38,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1183, Invalid=5623, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:12:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 13:12:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-10-15 13:12:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 13:12:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-10-15 13:12:38,515 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 168 [2018-10-15 13:12:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:38,516 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-10-15 13:12:38,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:12:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-10-15 13:12:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:12:38,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:38,517 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:38,517 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:38,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:38,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1407553942, now seen corresponding path program 16 times [2018-10-15 13:12:38,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 261 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:38,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:38,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:12:38,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:12:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:12:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:12:38,977 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 33 states. [2018-10-15 13:12:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:40,202 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2018-10-15 13:12:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:12:40,203 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 175 [2018-10-15 13:12:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:40,204 INFO L225 Difference]: With dead ends: 200 [2018-10-15 13:12:40,205 INFO L226 Difference]: Without dead ends: 200 [2018-10-15 13:12:40,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1404, Invalid=5906, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:12:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-15 13:12:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2018-10-15 13:12:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 13:12:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-15 13:12:40,211 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 175 [2018-10-15 13:12:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:40,211 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-15 13:12:40,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:12:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-15 13:12:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 13:12:40,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:40,213 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:40,213 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:40,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1518963955, now seen corresponding path program 17 times [2018-10-15 13:12:40,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 441 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:41,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:41,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:12:41,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:12:41,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:12:41,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1561, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:12:41,184 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 43 states. [2018-10-15 13:12:44,125 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-15 13:12:44,641 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-15 13:12:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:45,374 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-10-15 13:12:45,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:12:45,374 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 186 [2018-10-15 13:12:45,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:45,375 INFO L225 Difference]: With dead ends: 299 [2018-10-15 13:12:45,375 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 13:12:45,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1434, Invalid=6938, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 13:12:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 13:12:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-10-15 13:12:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 13:12:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-10-15 13:12:45,380 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 186 [2018-10-15 13:12:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:45,380 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-10-15 13:12:45,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:12:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-10-15 13:12:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:12:45,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:45,382 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:45,382 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:45,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1054430827, now seen corresponding path program 18 times [2018-10-15 13:12:45,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 325 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:46,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:46,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 13:12:46,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 13:12:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 13:12:46,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:12:46,376 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 36 states. [2018-10-15 13:12:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:47,982 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2018-10-15 13:12:47,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:12:47,983 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 193 [2018-10-15 13:12:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:47,984 INFO L225 Difference]: With dead ends: 218 [2018-10-15 13:12:47,984 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 13:12:47,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1699, Invalid=7231, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:12:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 13:12:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2018-10-15 13:12:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 13:12:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-10-15 13:12:47,989 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 193 [2018-10-15 13:12:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:47,990 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-10-15 13:12:47,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 13:12:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-10-15 13:12:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 13:12:47,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:47,991 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:47,991 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:47,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:47,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1251691090, now seen corresponding path program 19 times [2018-10-15 13:12:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 545 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:49,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:49,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:12:49,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:12:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:12:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:12:49,203 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 47 states. [2018-10-15 13:12:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:52,357 INFO L93 Difference]: Finished difference Result 328 states and 329 transitions. [2018-10-15 13:12:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:12:52,357 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 204 [2018-10-15 13:12:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:52,358 INFO L225 Difference]: With dead ends: 328 [2018-10-15 13:12:52,358 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 13:12:52,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1709, Invalid=8391, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:12:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 13:12:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-15 13:12:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-15 13:12:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-10-15 13:12:52,363 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 204 [2018-10-15 13:12:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:52,364 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-10-15 13:12:52,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:12:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-10-15 13:12:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-15 13:12:52,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:52,365 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:52,365 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:52,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2016893494, now seen corresponding path program 20 times [2018-10-15 13:12:52,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 396 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:53,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:53,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:12:53,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:12:53,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:12:53,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:12:53,258 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 39 states. [2018-10-15 13:12:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:54,792 INFO L93 Difference]: Finished difference Result 236 states and 237 transitions. [2018-10-15 13:12:54,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:12:54,795 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 211 [2018-10-15 13:12:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:54,796 INFO L225 Difference]: With dead ends: 236 [2018-10-15 13:12:54,796 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 13:12:54,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2022, Invalid=8690, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 13:12:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 13:12:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2018-10-15 13:12:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 13:12:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-10-15 13:12:54,802 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 211 [2018-10-15 13:12:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:54,803 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-10-15 13:12:54,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:12:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-10-15 13:12:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 13:12:54,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:54,804 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:54,804 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:54,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:54,805 INFO L82 PathProgramCache]: Analyzing trace with hash 323025299, now seen corresponding path program 21 times [2018-10-15 13:12:54,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 660 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:55,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:55,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:12:55,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:12:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:12:55,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:12:55,728 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 51 states. [2018-10-15 13:12:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:58,335 INFO L93 Difference]: Finished difference Result 357 states and 358 transitions. [2018-10-15 13:12:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:12:58,335 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 222 [2018-10-15 13:12:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:58,338 INFO L225 Difference]: With dead ends: 357 [2018-10-15 13:12:58,338 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 13:12:58,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2943 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2008, Invalid=9982, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 13:12:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 13:12:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-15 13:12:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 13:12:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-10-15 13:12:58,343 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 222 [2018-10-15 13:12:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:58,343 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-10-15 13:12:58,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:12:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-10-15 13:12:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 13:12:58,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:58,345 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 1, 1] [2018-10-15 13:12:58,345 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:58,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash 936077067, now seen corresponding path program 22 times [2018-10-15 13:12:58,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 474 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:59,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:59,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 13:12:59,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 13:12:59,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 13:12:59,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:12:59,044 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 42 states. [2018-10-15 13:13:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:00,861 INFO L93 Difference]: Finished difference Result 254 states and 255 transitions. [2018-10-15 13:13:00,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:13:00,862 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 229 [2018-10-15 13:13:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:00,865 INFO L225 Difference]: With dead ends: 254 [2018-10-15 13:13:00,865 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 13:13:00,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2373, Invalid=10283, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 13:13:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 13:13:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2018-10-15 13:13:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 13:13:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-10-15 13:13:00,870 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 229 [2018-10-15 13:13:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:00,871 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-10-15 13:13:00,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 13:13:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-10-15 13:13:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 13:13:00,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:00,873 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:00,873 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:00,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:00,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1882810958, now seen corresponding path program 23 times [2018-10-15 13:13:00,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 786 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:02,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:02,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:13:02,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:13:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:13:02,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2575, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:13:02,297 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 55 states. [2018-10-15 13:13:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:04,793 INFO L93 Difference]: Finished difference Result 386 states and 387 transitions. [2018-10-15 13:13:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:13:04,793 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 240 [2018-10-15 13:13:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:04,795 INFO L225 Difference]: With dead ends: 386 [2018-10-15 13:13:04,795 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 13:13:04,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3493 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2331, Invalid=11711, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:13:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 13:13:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-15 13:13:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 13:13:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-10-15 13:13:04,800 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 240 [2018-10-15 13:13:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:04,801 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-10-15 13:13:04,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:13:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-10-15 13:13:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 13:13:04,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:04,802 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1] [2018-10-15 13:13:04,803 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:04,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1498256682, now seen corresponding path program 24 times [2018-10-15 13:13:04,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 559 proven. 786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:06,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:06,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:13:06,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:13:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:13:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:13:06,047 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 45 states. [2018-10-15 13:13:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:09,234 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-10-15 13:13:09,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 13:13:09,236 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 247 [2018-10-15 13:13:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:09,237 INFO L225 Difference]: With dead ends: 272 [2018-10-15 13:13:09,238 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 13:13:09,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2752, Invalid=12010, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 13:13:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 13:13:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2018-10-15 13:13:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 13:13:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-15 13:13:09,243 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 247 [2018-10-15 13:13:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:09,244 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-15 13:13:09,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:13:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-15 13:13:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 13:13:09,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:09,245 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 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, 1, 1] [2018-10-15 13:13:09,245 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:09,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1556173261, now seen corresponding path program 25 times [2018-10-15 13:13:09,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 923 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:11,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:11,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:13:11,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:13:11,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:13:11,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2969, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:13:11,647 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 59 states. [2018-10-15 13:13:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:15,165 INFO L93 Difference]: Finished difference Result 415 states and 416 transitions. [2018-10-15 13:13:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:13:15,166 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 258 [2018-10-15 13:13:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:15,167 INFO L225 Difference]: With dead ends: 415 [2018-10-15 13:13:15,167 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 13:13:15,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4090 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2678, Invalid=13578, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 13:13:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 13:13:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-10-15 13:13:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:13:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2018-10-15 13:13:15,172 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 258 [2018-10-15 13:13:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:15,173 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2018-10-15 13:13:15,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:13:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2018-10-15 13:13:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 13:13:15,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:15,174 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 1, 1] [2018-10-15 13:13:15,175 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:15,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1988214699, now seen corresponding path program 26 times [2018-10-15 13:13:15,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 651 proven. 923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:16,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 13:13:16,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 13:13:16,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 13:13:16,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:13:16,464 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 48 states. [2018-10-15 13:13:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:18,981 INFO L93 Difference]: Finished difference Result 290 states and 291 transitions. [2018-10-15 13:13:18,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 13:13:18,982 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 265 [2018-10-15 13:13:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:18,984 INFO L225 Difference]: With dead ends: 290 [2018-10-15 13:13:18,984 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 13:13:18,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3159, Invalid=13871, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:13:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 13:13:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 277. [2018-10-15 13:13:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 13:13:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-10-15 13:13:18,990 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 265 [2018-10-15 13:13:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:18,991 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-10-15 13:13:18,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 13:13:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-10-15 13:13:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 13:13:18,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:18,993 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 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, 1, 1] [2018-10-15 13:13:18,993 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:18,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash 53516562, now seen corresponding path program 27 times [2018-10-15 13:13:18,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 1071 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:20,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:20,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:13:20,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:13:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:13:20,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3391, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:13:20,738 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 63 states. [2018-10-15 13:13:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:24,319 INFO L93 Difference]: Finished difference Result 444 states and 445 transitions. [2018-10-15 13:13:24,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 13:13:24,319 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 276 [2018-10-15 13:13:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:24,321 INFO L225 Difference]: With dead ends: 444 [2018-10-15 13:13:24,321 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 13:13:24,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4734 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3049, Invalid=15583, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:13:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 13:13:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-15 13:13:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:13:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 285 transitions. [2018-10-15 13:13:24,326 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 285 transitions. Word has length 276 [2018-10-15 13:13:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:24,326 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 285 transitions. [2018-10-15 13:13:24,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:13:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 285 transitions. [2018-10-15 13:13:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-15 13:13:24,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:24,328 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1] [2018-10-15 13:13:24,328 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:24,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:24,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1678720138, now seen corresponding path program 28 times [2018-10-15 13:13:24,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 750 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:25,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:25,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:13:25,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:13:25,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:13:25,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:13:25,234 INFO L87 Difference]: Start difference. First operand 284 states and 285 transitions. Second operand 51 states. [2018-10-15 13:13:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:27,894 INFO L93 Difference]: Finished difference Result 308 states and 309 transitions. [2018-10-15 13:13:27,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:13:27,895 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 283 [2018-10-15 13:13:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:27,896 INFO L225 Difference]: With dead ends: 308 [2018-10-15 13:13:27,897 INFO L226 Difference]: Without dead ends: 308 [2018-10-15 13:13:27,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6203 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3594, Invalid=15866, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 13:13:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-15 13:13:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2018-10-15 13:13:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 13:13:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-15 13:13:27,902 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 283 [2018-10-15 13:13:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:27,903 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-15 13:13:27,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:13:27,903 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-15 13:13:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 13:13:27,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:27,905 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 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, 1, 1] [2018-10-15 13:13:27,905 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:27,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -883119405, now seen corresponding path program 29 times [2018-10-15 13:13:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 1230 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:29,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:29,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:13:29,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:13:29,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:13:29,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=3841, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:13:29,367 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 67 states. [2018-10-15 13:13:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:33,190 INFO L93 Difference]: Finished difference Result 473 states and 474 transitions. [2018-10-15 13:13:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 13:13:33,191 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 294 [2018-10-15 13:13:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:33,192 INFO L225 Difference]: With dead ends: 473 [2018-10-15 13:13:33,192 INFO L226 Difference]: Without dead ends: 304 [2018-10-15 13:13:33,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5425 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3444, Invalid=17726, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 13:13:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-15 13:13:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2018-10-15 13:13:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 13:13:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2018-10-15 13:13:33,196 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 294 [2018-10-15 13:13:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:33,197 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2018-10-15 13:13:33,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:13:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2018-10-15 13:13:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 13:13:33,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:33,198 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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, 1, 1] [2018-10-15 13:13:33,198 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:33,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:33,199 INFO L82 PathProgramCache]: Analyzing trace with hash -724148149, now seen corresponding path program 30 times [2018-10-15 13:13:33,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2086 backedges. 856 proven. 1230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:34,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:34,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 13:13:34,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 13:13:34,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 13:13:34,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:13:34,181 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 54 states. [2018-10-15 13:13:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:36,957 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-15 13:13:36,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 13:13:36,957 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 301 [2018-10-15 13:13:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:36,960 INFO L225 Difference]: With dead ends: 326 [2018-10-15 13:13:36,960 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 13:13:36,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7065 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4057, Invalid=17995, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:13:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 13:13:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2018-10-15 13:13:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 13:13:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-10-15 13:13:36,966 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 301 [2018-10-15 13:13:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:36,967 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-10-15 13:13:36,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 13:13:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-10-15 13:13:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 13:13:36,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:36,969 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 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, 1, 1] [2018-10-15 13:13:36,969 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:36,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:36,970 INFO L82 PathProgramCache]: Analyzing trace with hash -21015438, now seen corresponding path program 31 times [2018-10-15 13:13:36,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 1400 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:38,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:38,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:13:38,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:13:38,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:13:38,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=4319, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:13:38,847 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 71 states. [2018-10-15 13:13:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:42,215 INFO L93 Difference]: Finished difference Result 502 states and 503 transitions. [2018-10-15 13:13:42,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 13:13:42,215 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 312 [2018-10-15 13:13:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:42,217 INFO L225 Difference]: With dead ends: 502 [2018-10-15 13:13:42,217 INFO L226 Difference]: Without dead ends: 322 [2018-10-15 13:13:42,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6163 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3863, Invalid=20007, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 13:13:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-15 13:13:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-15 13:13:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 13:13:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2018-10-15 13:13:42,223 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 312 [2018-10-15 13:13:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:42,223 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2018-10-15 13:13:42,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:13:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2018-10-15 13:13:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 13:13:42,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:42,225 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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, 1, 1] [2018-10-15 13:13:42,225 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:42,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:42,226 INFO L82 PathProgramCache]: Analyzing trace with hash -621569046, now seen corresponding path program 32 times [2018-10-15 13:13:42,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2369 backedges. 969 proven. 1400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:43,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:43,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:13:43,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:13:43,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:13:43,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:13:43,532 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 57 states. [2018-10-15 13:13:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:46,636 INFO L93 Difference]: Finished difference Result 344 states and 345 transitions. [2018-10-15 13:13:46,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 13:13:46,637 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 319 [2018-10-15 13:13:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:46,640 INFO L225 Difference]: With dead ends: 344 [2018-10-15 13:13:46,640 INFO L226 Difference]: Without dead ends: 344 [2018-10-15 13:13:46,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7983 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4548, Invalid=20258, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 13:13:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-15 13:13:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2018-10-15 13:13:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 13:13:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-10-15 13:13:46,646 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 319 [2018-10-15 13:13:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:46,647 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-10-15 13:13:46,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:13:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-10-15 13:13:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-15 13:13:46,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:46,649 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 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, 1, 1] [2018-10-15 13:13:46,649 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:46,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1393234061, now seen corresponding path program 33 times [2018-10-15 13:13:46,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1581 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:49,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:49,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:13:49,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:13:49,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:13:49,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=4825, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:13:49,471 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 75 states. [2018-10-15 13:13:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:54,279 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-10-15 13:13:54,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 13:13:54,279 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 330 [2018-10-15 13:13:54,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:54,281 INFO L225 Difference]: With dead ends: 531 [2018-10-15 13:13:54,281 INFO L226 Difference]: Without dead ends: 340 [2018-10-15 13:13:54,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6948 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4306, Invalid=22426, Unknown=0, NotChecked=0, Total=26732 [2018-10-15 13:13:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-15 13:13:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2018-10-15 13:13:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-15 13:13:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 339 transitions. [2018-10-15 13:13:54,286 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 339 transitions. Word has length 330 [2018-10-15 13:13:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:54,287 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 339 transitions. [2018-10-15 13:13:54,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:13:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 339 transitions. [2018-10-15 13:13:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-15 13:13:54,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:54,289 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1] [2018-10-15 13:13:54,289 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:54,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash 220416235, now seen corresponding path program 34 times [2018-10-15 13:13:54,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 1089 proven. 1581 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:56,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:56,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 13:13:56,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 13:13:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 13:13:56,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:13:56,146 INFO L87 Difference]: Start difference. First operand 338 states and 339 transitions. Second operand 60 states. [2018-10-15 13:13:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:59,678 INFO L93 Difference]: Finished difference Result 362 states and 363 transitions. [2018-10-15 13:13:59,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:13:59,679 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 337 [2018-10-15 13:13:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:59,681 INFO L225 Difference]: With dead ends: 362 [2018-10-15 13:13:59,681 INFO L226 Difference]: Without dead ends: 362 [2018-10-15 13:13:59,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8957 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5067, Invalid=22655, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 13:13:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-15 13:13:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 349. [2018-10-15 13:13:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 13:13:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-10-15 13:13:59,687 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 337 [2018-10-15 13:13:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:59,687 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-10-15 13:13:59,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 13:13:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-10-15 13:13:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 13:13:59,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:59,690 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 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, 1, 1] [2018-10-15 13:13:59,690 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:59,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1411856430, now seen corresponding path program 35 times [2018-10-15 13:13:59,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 1773 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:01,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:01,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:14:01,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:14:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:14:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=5359, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:14:01,591 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 79 states. [2018-10-15 13:14:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:06,234 INFO L93 Difference]: Finished difference Result 560 states and 561 transitions. [2018-10-15 13:14:06,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 13:14:06,235 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 348 [2018-10-15 13:14:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:06,236 INFO L225 Difference]: With dead ends: 560 [2018-10-15 13:14:06,236 INFO L226 Difference]: Without dead ends: 358 [2018-10-15 13:14:06,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7780 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4773, Invalid=24983, Unknown=0, NotChecked=0, Total=29756 [2018-10-15 13:14:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-15 13:14:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-10-15 13:14:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-15 13:14:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-10-15 13:14:06,241 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 348 [2018-10-15 13:14:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:06,241 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-10-15 13:14:06,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:14:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-10-15 13:14:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-15 13:14:06,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:06,243 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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, 1, 1] [2018-10-15 13:14:06,244 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:06,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1080079178, now seen corresponding path program 36 times [2018-10-15 13:14:06,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2989 backedges. 1216 proven. 1773 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:08,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:08,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:14:08,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:14:08,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:14:08,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:14:08,189 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 63 states. [2018-10-15 13:14:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:12,188 INFO L93 Difference]: Finished difference Result 380 states and 381 transitions. [2018-10-15 13:14:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 13:14:12,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 355 [2018-10-15 13:14:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:12,191 INFO L225 Difference]: With dead ends: 380 [2018-10-15 13:14:12,191 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 13:14:12,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9987 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5614, Invalid=25186, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 13:14:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 13:14:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 367. [2018-10-15 13:14:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-15 13:14:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-10-15 13:14:12,197 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 355 [2018-10-15 13:14:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:12,197 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-10-15 13:14:12,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:14:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-10-15 13:14:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-15 13:14:12,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:12,200 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 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, 1, 1] [2018-10-15 13:14:12,200 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:12,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1776385043, now seen corresponding path program 37 times [2018-10-15 13:14:12,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 1976 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:14,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:14:14,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:14:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:14:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=5921, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:14:14,550 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 83 states. [2018-10-15 13:14:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:20,359 INFO L93 Difference]: Finished difference Result 589 states and 590 transitions. [2018-10-15 13:14:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 13:14:20,359 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 366 [2018-10-15 13:14:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:20,361 INFO L225 Difference]: With dead ends: 589 [2018-10-15 13:14:20,361 INFO L226 Difference]: Without dead ends: 376 [2018-10-15 13:14:20,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8659 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5264, Invalid=27678, Unknown=0, NotChecked=0, Total=32942 [2018-10-15 13:14:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-15 13:14:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2018-10-15 13:14:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:14:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 375 transitions. [2018-10-15 13:14:20,365 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 375 transitions. Word has length 366 [2018-10-15 13:14:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:20,366 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 375 transitions. [2018-10-15 13:14:20,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:14:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 375 transitions. [2018-10-15 13:14:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 13:14:20,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:20,368 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1] [2018-10-15 13:14:20,368 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:20,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1514305931, now seen corresponding path program 38 times [2018-10-15 13:14:20,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3326 backedges. 1350 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:22,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:22,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 13:14:22,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 13:14:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 13:14:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3548, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:14:22,032 INFO L87 Difference]: Start difference. First operand 374 states and 375 transitions. Second operand 66 states. [2018-10-15 13:14:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:26,399 INFO L93 Difference]: Finished difference Result 398 states and 399 transitions. [2018-10-15 13:14:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 13:14:26,400 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 373 [2018-10-15 13:14:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:26,401 INFO L225 Difference]: With dead ends: 398 [2018-10-15 13:14:26,401 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 13:14:26,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11073 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6189, Invalid=27851, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 13:14:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 13:14:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 385. [2018-10-15 13:14:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-15 13:14:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-10-15 13:14:26,407 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 373 [2018-10-15 13:14:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:26,408 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-10-15 13:14:26,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 13:14:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-10-15 13:14:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-15 13:14:26,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:26,410 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 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, 1, 1] [2018-10-15 13:14:26,411 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:26,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1667429170, now seen corresponding path program 39 times [2018-10-15 13:14:26,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 2190 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:28,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:28,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:14:28,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:14:28,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:14:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=971, Invalid=6511, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:14:28,806 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 87 states. [2018-10-15 13:14:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:35,322 INFO L93 Difference]: Finished difference Result 618 states and 619 transitions. [2018-10-15 13:14:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 13:14:35,322 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 384 [2018-10-15 13:14:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:35,323 INFO L225 Difference]: With dead ends: 618 [2018-10-15 13:14:35,323 INFO L226 Difference]: Without dead ends: 394 [2018-10-15 13:14:35,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9585 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5779, Invalid=30511, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 13:14:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-15 13:14:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2018-10-15 13:14:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:14:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2018-10-15 13:14:35,329 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 384 [2018-10-15 13:14:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:35,329 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2018-10-15 13:14:35,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:14:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2018-10-15 13:14:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-15 13:14:35,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:35,331 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 1, 1] [2018-10-15 13:14:35,332 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:35,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -969112918, now seen corresponding path program 40 times [2018-10-15 13:14:35,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 1491 proven. 2190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:36,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:36,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:14:36,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:14:36,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:14:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3882, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:14:36,902 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 69 states. [2018-10-15 13:14:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:41,201 INFO L93 Difference]: Finished difference Result 416 states and 417 transitions. [2018-10-15 13:14:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 13:14:41,201 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 391 [2018-10-15 13:14:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:41,204 INFO L225 Difference]: With dead ends: 416 [2018-10-15 13:14:41,204 INFO L226 Difference]: Without dead ends: 416 [2018-10-15 13:14:41,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12215 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6792, Invalid=30650, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 13:14:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-15 13:14:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 403. [2018-10-15 13:14:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 13:14:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-10-15 13:14:41,211 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 391 [2018-10-15 13:14:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:41,211 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-10-15 13:14:41,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:14:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-10-15 13:14:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 13:14:41,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:41,214 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 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, 1, 1] [2018-10-15 13:14:41,214 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:41,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash -998485837, now seen corresponding path program 41 times [2018-10-15 13:14:41,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 2415 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:43,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:43,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:14:43,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:14:43,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:14:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1061, Invalid=7129, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:14:43,693 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 91 states. [2018-10-15 13:14:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:51,103 INFO L93 Difference]: Finished difference Result 647 states and 648 transitions. [2018-10-15 13:14:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 13:14:51,103 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 402 [2018-10-15 13:14:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:51,105 INFO L225 Difference]: With dead ends: 647 [2018-10-15 13:14:51,105 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 13:14:51,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10558 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=6318, Invalid=33482, Unknown=0, NotChecked=0, Total=39800 [2018-10-15 13:14:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 13:14:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2018-10-15 13:14:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:14:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2018-10-15 13:14:51,111 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 402 [2018-10-15 13:14:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:51,111 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2018-10-15 13:14:51,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:14:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2018-10-15 13:14:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 13:14:51,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:51,114 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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, 1, 1] [2018-10-15 13:14:51,114 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:51,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash 395178539, now seen corresponding path program 42 times [2018-10-15 13:14:51,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 1639 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:52,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:52,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 13:14:52,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 13:14:52,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 13:14:52,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:14:52,863 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 72 states. [2018-10-15 13:14:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:57,929 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-15 13:14:57,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 13:14:57,929 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 409 [2018-10-15 13:14:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:57,932 INFO L225 Difference]: With dead ends: 434 [2018-10-15 13:14:57,932 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 13:14:57,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13413 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7423, Invalid=33583, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 13:14:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 13:14:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 421. [2018-10-15 13:14:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-15 13:14:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-10-15 13:14:57,939 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 409 [2018-10-15 13:14:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:57,939 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-10-15 13:14:57,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 13:14:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-10-15 13:14:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-15 13:14:57,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:57,942 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 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, 1, 1] [2018-10-15 13:14:57,942 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:57,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:57,942 INFO L82 PathProgramCache]: Analyzing trace with hash 230938258, now seen corresponding path program 43 times [2018-10-15 13:14:57,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 2651 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:00,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:00,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:15:00,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:15:00,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:15:00,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=7775, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:15:00,977 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 95 states. [2018-10-15 13:15:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:08,431 INFO L93 Difference]: Finished difference Result 676 states and 677 transitions. [2018-10-15 13:15:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 13:15:08,431 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 420 [2018-10-15 13:15:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:08,432 INFO L225 Difference]: With dead ends: 676 [2018-10-15 13:15:08,432 INFO L226 Difference]: Without dead ends: 430 [2018-10-15 13:15:08,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11578 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6881, Invalid=36591, Unknown=0, NotChecked=0, Total=43472 [2018-10-15 13:15:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-15 13:15:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2018-10-15 13:15:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:15:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 429 transitions. [2018-10-15 13:15:08,438 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 429 transitions. Word has length 420 [2018-10-15 13:15:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:08,439 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 429 transitions. [2018-10-15 13:15:08,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:15:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 429 transitions. [2018-10-15 13:15:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-15 13:15:08,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:08,441 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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, 1, 1] [2018-10-15 13:15:08,442 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:08,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:08,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1376974326, now seen corresponding path program 44 times [2018-10-15 13:15:08,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 1794 proven. 2651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:10,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:10,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:15:10,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:15:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:15:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:15:10,476 INFO L87 Difference]: Start difference. First operand 428 states and 429 transitions. Second operand 75 states. [2018-10-15 13:15:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:15,781 INFO L93 Difference]: Finished difference Result 452 states and 453 transitions. [2018-10-15 13:15:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 13:15:15,781 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 427 [2018-10-15 13:15:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:15,784 INFO L225 Difference]: With dead ends: 452 [2018-10-15 13:15:15,784 INFO L226 Difference]: Without dead ends: 452 [2018-10-15 13:15:15,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8082, Invalid=36650, Unknown=0, NotChecked=0, Total=44732 [2018-10-15 13:15:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-10-15 13:15:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 439. [2018-10-15 13:15:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-15 13:15:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-10-15 13:15:15,790 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 427 [2018-10-15 13:15:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:15,790 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-10-15 13:15:15,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:15:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-10-15 13:15:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-15 13:15:15,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:15,793 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 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, 1, 1] [2018-10-15 13:15:15,793 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:15,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1080070829, now seen corresponding path program 45 times [2018-10-15 13:15:15,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 2898 proven. 1794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:18,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:18,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:15:18,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:15:18,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:15:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1253, Invalid=8449, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:15:18,646 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 99 states. [2018-10-15 13:15:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:26,779 INFO L93 Difference]: Finished difference Result 705 states and 706 transitions. [2018-10-15 13:15:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 13:15:26,779 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 438 [2018-10-15 13:15:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:26,781 INFO L225 Difference]: With dead ends: 705 [2018-10-15 13:15:26,781 INFO L226 Difference]: Without dead ends: 448 [2018-10-15 13:15:26,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12645 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=7468, Invalid=39838, Unknown=0, NotChecked=0, Total=47306 [2018-10-15 13:15:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-15 13:15:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2018-10-15 13:15:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-15 13:15:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 447 transitions. [2018-10-15 13:15:26,786 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 447 transitions. Word has length 438 [2018-10-15 13:15:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:26,786 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 447 transitions. [2018-10-15 13:15:26,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:15:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 447 transitions. [2018-10-15 13:15:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-15 13:15:26,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:26,788 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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, 1, 1] [2018-10-15 13:15:26,788 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:26,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1625273035, now seen corresponding path program 46 times [2018-10-15 13:15:26,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4854 backedges. 1956 proven. 2898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:28,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:28,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 13:15:28,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 13:15:28,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 13:15:28,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=4974, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:15:28,677 INFO L87 Difference]: Start difference. First operand 446 states and 447 transitions. Second operand 78 states. [2018-10-15 13:15:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:34,603 INFO L93 Difference]: Finished difference Result 470 states and 471 transitions. [2018-10-15 13:15:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 13:15:34,603 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 445 [2018-10-15 13:15:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:34,606 INFO L225 Difference]: With dead ends: 470 [2018-10-15 13:15:34,606 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 13:15:34,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15977 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8769, Invalid=39851, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 13:15:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 13:15:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 457. [2018-10-15 13:15:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-15 13:15:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 458 transitions. [2018-10-15 13:15:34,612 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 458 transitions. Word has length 445 [2018-10-15 13:15:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:34,612 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 458 transitions. [2018-10-15 13:15:34,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 13:15:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 458 transitions. [2018-10-15 13:15:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-15 13:15:34,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:34,614 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 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, 1, 1] [2018-10-15 13:15:34,614 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:34,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2099154446, now seen corresponding path program 47 times [2018-10-15 13:15:34,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 3156 proven. 1956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:38,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:38,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 13:15:38,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 13:15:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 13:15:38,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1355, Invalid=9151, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:15:38,290 INFO L87 Difference]: Start difference. First operand 457 states and 458 transitions. Second operand 103 states. [2018-10-15 13:15:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:47,056 INFO L93 Difference]: Finished difference Result 734 states and 735 transitions. [2018-10-15 13:15:47,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-15 13:15:47,057 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 456 [2018-10-15 13:15:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:47,058 INFO L225 Difference]: With dead ends: 734 [2018-10-15 13:15:47,058 INFO L226 Difference]: Without dead ends: 466 [2018-10-15 13:15:47,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13759 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=8079, Invalid=43223, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 13:15:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-10-15 13:15:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2018-10-15 13:15:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-15 13:15:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2018-10-15 13:15:47,065 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 456 [2018-10-15 13:15:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:47,066 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2018-10-15 13:15:47,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 13:15:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2018-10-15 13:15:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-15 13:15:47,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:47,069 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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, 1, 1] [2018-10-15 13:15:47,069 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:47,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1470609046, now seen corresponding path program 48 times [2018-10-15 13:15:47,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5281 backedges. 2125 proven. 3156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:49,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:49,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:15:49,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:15:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:15:49,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=5368, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:15:49,042 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 81 states. [2018-10-15 13:15:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:55,235 INFO L93 Difference]: Finished difference Result 488 states and 489 transitions. [2018-10-15 13:15:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 13:15:55,236 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 463 [2018-10-15 13:15:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:55,238 INFO L225 Difference]: With dead ends: 488 [2018-10-15 13:15:55,239 INFO L226 Difference]: Without dead ends: 488 [2018-10-15 13:15:55,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17343 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9484, Invalid=43186, Unknown=0, NotChecked=0, Total=52670 [2018-10-15 13:15:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-15 13:15:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 475. [2018-10-15 13:15:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-15 13:15:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 476 transitions. [2018-10-15 13:15:55,246 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 476 transitions. Word has length 463 [2018-10-15 13:15:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:55,247 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 476 transitions. [2018-10-15 13:15:55,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:15:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 476 transitions. [2018-10-15 13:15:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-15 13:15:55,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:55,250 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 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, 1, 1] [2018-10-15 13:15:55,250 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:55,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:55,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1050989043, now seen corresponding path program 49 times [2018-10-15 13:15:55,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 3425 proven. 2125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:58,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:58,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 13:15:58,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 13:15:58,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 13:15:58,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1461, Invalid=9881, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:15:58,785 INFO L87 Difference]: Start difference. First operand 475 states and 476 transitions. Second operand 107 states. [2018-10-15 13:16:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:08,239 INFO L93 Difference]: Finished difference Result 763 states and 764 transitions. [2018-10-15 13:16:08,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 13:16:08,239 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 474 [2018-10-15 13:16:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:08,241 INFO L225 Difference]: With dead ends: 763 [2018-10-15 13:16:08,241 INFO L226 Difference]: Without dead ends: 484 [2018-10-15 13:16:08,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14920 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=8714, Invalid=46746, Unknown=0, NotChecked=0, Total=55460 [2018-10-15 13:16:08,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-15 13:16:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2018-10-15 13:16:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-15 13:16:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 483 transitions. [2018-10-15 13:16:08,246 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 483 transitions. Word has length 474 [2018-10-15 13:16:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:08,246 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 483 transitions. [2018-10-15 13:16:08,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 13:16:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 483 transitions. [2018-10-15 13:16:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-15 13:16:08,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:08,249 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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, 1, 1] [2018-10-15 13:16:08,249 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:08,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:08,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1299072149, now seen corresponding path program 50 times [2018-10-15 13:16:08,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5726 backedges. 2301 proven. 3425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:10,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:10,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 13:16:10,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 13:16:10,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 13:16:10,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5777, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:16:10,318 INFO L87 Difference]: Start difference. First operand 482 states and 483 transitions. Second operand 84 states. [2018-10-15 13:16:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:17,153 INFO L93 Difference]: Finished difference Result 506 states and 507 transitions. [2018-10-15 13:16:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 13:16:17,154 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 481 [2018-10-15 13:16:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:17,157 INFO L225 Difference]: With dead ends: 506 [2018-10-15 13:16:17,157 INFO L226 Difference]: Without dead ends: 506 [2018-10-15 13:16:17,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18765 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10227, Invalid=46655, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:16:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-10-15 13:16:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 493. [2018-10-15 13:16:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-15 13:16:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 494 transitions. [2018-10-15 13:16:17,164 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 494 transitions. Word has length 481 [2018-10-15 13:16:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:17,164 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 494 transitions. [2018-10-15 13:16:17,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 13:16:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 494 transitions. [2018-10-15 13:16:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-15 13:16:17,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:17,167 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 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, 1, 1] [2018-10-15 13:16:17,167 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:17,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash -366885550, now seen corresponding path program 51 times [2018-10-15 13:16:17,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 3705 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:20,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:20,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 13:16:20,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 13:16:20,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 13:16:20,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1571, Invalid=10639, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:16:20,877 INFO L87 Difference]: Start difference. First operand 493 states and 494 transitions. Second operand 111 states. [2018-10-15 13:16:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:31,114 INFO L93 Difference]: Finished difference Result 792 states and 793 transitions. [2018-10-15 13:16:31,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-15 13:16:31,114 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 492 [2018-10-15 13:16:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:31,116 INFO L225 Difference]: With dead ends: 792 [2018-10-15 13:16:31,116 INFO L226 Difference]: Without dead ends: 502 [2018-10-15 13:16:31,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16128 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=9373, Invalid=50407, Unknown=0, NotChecked=0, Total=59780 [2018-10-15 13:16:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-10-15 13:16:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2018-10-15 13:16:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 13:16:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 501 transitions. [2018-10-15 13:16:31,120 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 501 transitions. Word has length 492 [2018-10-15 13:16:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:31,121 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 501 transitions. [2018-10-15 13:16:31,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 13:16:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 501 transitions. [2018-10-15 13:16:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 13:16:31,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:31,123 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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, 1, 1] [2018-10-15 13:16:31,123 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:31,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash 904151242, now seen corresponding path program 52 times [2018-10-15 13:16:31,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6189 backedges. 2484 proven. 3705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:33,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:33,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:16:33,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:16:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:16:33,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=6201, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:16:33,558 INFO L87 Difference]: Start difference. First operand 500 states and 501 transitions. Second operand 87 states. [2018-10-15 13:16:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:40,612 INFO L93 Difference]: Finished difference Result 524 states and 525 transitions. [2018-10-15 13:16:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:16:40,613 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 499 [2018-10-15 13:16:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:40,616 INFO L225 Difference]: With dead ends: 524 [2018-10-15 13:16:40,616 INFO L226 Difference]: Without dead ends: 524 [2018-10-15 13:16:40,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20243 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10998, Invalid=50258, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 13:16:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-15 13:16:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 511. [2018-10-15 13:16:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-15 13:16:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-10-15 13:16:40,621 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 499 [2018-10-15 13:16:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:40,622 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-10-15 13:16:40,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:16:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-10-15 13:16:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-15 13:16:40,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:40,624 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 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, 1, 1] [2018-10-15 13:16:40,624 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:40,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1520009581, now seen corresponding path program 53 times [2018-10-15 13:16:40,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3996 proven. 2484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 13:16:44,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 13:16:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 13:16:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=11425, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:16:44,677 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 115 states. [2018-10-15 13:16:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:55,478 INFO L93 Difference]: Finished difference Result 821 states and 822 transitions. [2018-10-15 13:16:55,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-15 13:16:55,478 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 510 [2018-10-15 13:16:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:55,480 INFO L225 Difference]: With dead ends: 821 [2018-10-15 13:16:55,480 INFO L226 Difference]: Without dead ends: 520 [2018-10-15 13:16:55,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17383 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=10056, Invalid=54206, Unknown=0, NotChecked=0, Total=64262 [2018-10-15 13:16:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-15 13:16:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2018-10-15 13:16:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-15 13:16:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 519 transitions. [2018-10-15 13:16:55,486 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 519 transitions. Word has length 510 [2018-10-15 13:16:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:55,486 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 519 transitions. [2018-10-15 13:16:55,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 13:16:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 519 transitions. [2018-10-15 13:16:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-10-15 13:16:55,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:55,488 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 1, 1] [2018-10-15 13:16:55,488 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:55,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1988228085, now seen corresponding path program 54 times [2018-10-15 13:16:55,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 2674 proven. 3996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:58,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:58,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 13:16:58,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 13:16:58,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 13:16:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=6640, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:16:58,058 INFO L87 Difference]: Start difference. First operand 518 states and 519 transitions. Second operand 90 states. [2018-10-15 13:17:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:05,541 INFO L93 Difference]: Finished difference Result 542 states and 543 transitions. [2018-10-15 13:17:05,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 13:17:05,541 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 517 [2018-10-15 13:17:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:05,543 INFO L225 Difference]: With dead ends: 542 [2018-10-15 13:17:05,543 INFO L226 Difference]: Without dead ends: 542 [2018-10-15 13:17:05,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11797, Invalid=53995, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 13:17:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-15 13:17:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 529. [2018-10-15 13:17:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-15 13:17:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 530 transitions. [2018-10-15 13:17:05,551 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 530 transitions. Word has length 517 [2018-10-15 13:17:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:05,551 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 530 transitions. [2018-10-15 13:17:05,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 13:17:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 530 transitions. [2018-10-15 13:17:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-15 13:17:05,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:05,553 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 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, 1, 1] [2018-10-15 13:17:05,554 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:05,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 443207858, now seen corresponding path program 55 times [2018-10-15 13:17:05,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 4298 proven. 2674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:09,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:09,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 13:17:09,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 13:17:09,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 13:17:09,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1803, Invalid=12239, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:17:09,938 INFO L87 Difference]: Start difference. First operand 529 states and 530 transitions. Second operand 119 states. [2018-10-15 13:17:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:18,155 INFO L93 Difference]: Finished difference Result 850 states and 851 transitions. [2018-10-15 13:17:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-15 13:17:18,155 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 528 [2018-10-15 13:17:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:18,157 INFO L225 Difference]: With dead ends: 850 [2018-10-15 13:17:18,157 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 13:17:18,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18685 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=10763, Invalid=58143, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:17:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 13:17:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2018-10-15 13:17:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-15 13:17:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2018-10-15 13:17:18,162 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 528 [2018-10-15 13:17:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:18,162 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2018-10-15 13:17:18,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:17:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2018-10-15 13:17:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-10-15 13:17:18,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:18,164 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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, 1, 1] [2018-10-15 13:17:18,164 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:18,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash 108458026, now seen corresponding path program 56 times [2018-10-15 13:17:18,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7169 backedges. 2871 proven. 4298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:20,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:20,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:17:20,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:17:20,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:17:20,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1462, Invalid=7094, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:17:20,742 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 93 states. [2018-10-15 13:17:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:28,812 INFO L93 Difference]: Finished difference Result 560 states and 561 transitions. [2018-10-15 13:17:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 13:17:28,813 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 535 [2018-10-15 13:17:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:28,816 INFO L225 Difference]: With dead ends: 560 [2018-10-15 13:17:28,816 INFO L226 Difference]: Without dead ends: 560 [2018-10-15 13:17:28,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12624, Invalid=57866, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 13:17:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-15 13:17:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 547. [2018-10-15 13:17:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-15 13:17:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 548 transitions. [2018-10-15 13:17:28,824 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 548 transitions. Word has length 535 [2018-10-15 13:17:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:28,824 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 548 transitions. [2018-10-15 13:17:28,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:17:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 548 transitions. [2018-10-15 13:17:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-10-15 13:17:28,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:28,827 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 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, 1, 1] [2018-10-15 13:17:28,827 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:28,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2017358643, now seen corresponding path program 57 times [2018-10-15 13:17:28,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 4611 proven. 2871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:33,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:33,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:17:33,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:17:33,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:17:33,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1925, Invalid=13081, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:17:33,283 INFO L87 Difference]: Start difference. First operand 547 states and 548 transitions. Second operand 123 states. [2018-10-15 13:17:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:42,830 INFO L93 Difference]: Finished difference Result 879 states and 880 transitions. [2018-10-15 13:17:42,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-15 13:17:42,831 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 546 [2018-10-15 13:17:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:42,832 INFO L225 Difference]: With dead ends: 879 [2018-10-15 13:17:42,832 INFO L226 Difference]: Without dead ends: 556 [2018-10-15 13:17:42,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20034 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=11494, Invalid=62218, Unknown=0, NotChecked=0, Total=73712 [2018-10-15 13:17:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-10-15 13:17:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2018-10-15 13:17:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-15 13:17:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2018-10-15 13:17:42,840 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 546 [2018-10-15 13:17:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:42,840 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2018-10-15 13:17:42,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:17:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2018-10-15 13:17:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-10-15 13:17:42,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:42,843 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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, 1, 1] [2018-10-15 13:17:42,843 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:42,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:42,844 INFO L82 PathProgramCache]: Analyzing trace with hash 50242731, now seen corresponding path program 58 times [2018-10-15 13:17:42,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7686 backedges. 3075 proven. 4611 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:45,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:45,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 13:17:45,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 13:17:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 13:17:45,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=7563, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 13:17:45,689 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 96 states. [2018-10-15 13:17:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:54,281 INFO L93 Difference]: Finished difference Result 578 states and 579 transitions. [2018-10-15 13:17:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:17:54,282 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 553 [2018-10-15 13:17:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:54,284 INFO L225 Difference]: With dead ends: 578 [2018-10-15 13:17:54,284 INFO L226 Difference]: Without dead ends: 578 [2018-10-15 13:17:54,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25013 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13479, Invalid=61871, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:17:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-15 13:17:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 565. [2018-10-15 13:17:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-15 13:17:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 566 transitions. [2018-10-15 13:17:54,291 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 566 transitions. Word has length 553 [2018-10-15 13:17:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:54,291 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 566 transitions. [2018-10-15 13:17:54,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 13:17:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 566 transitions. [2018-10-15 13:17:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-10-15 13:17:54,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:54,294 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 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, 1, 1] [2018-10-15 13:17:54,294 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:54,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -98397166, now seen corresponding path program 59 times [2018-10-15 13:17:54,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 4935 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:58,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:58,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:17:58,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:17:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:17:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2051, Invalid=13951, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:17:58,874 INFO L87 Difference]: Start difference. First operand 565 states and 566 transitions. Second operand 127 states. [2018-10-15 13:18:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:11,854 INFO L93 Difference]: Finished difference Result 908 states and 909 transitions. [2018-10-15 13:18:11,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 13:18:11,854 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 564 [2018-10-15 13:18:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:11,856 INFO L225 Difference]: With dead ends: 908 [2018-10-15 13:18:11,856 INFO L226 Difference]: Without dead ends: 574 [2018-10-15 13:18:11,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21430 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=12249, Invalid=66431, Unknown=0, NotChecked=0, Total=78680 [2018-10-15 13:18:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-10-15 13:18:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2018-10-15 13:18:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-15 13:18:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 573 transitions. [2018-10-15 13:18:11,862 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 573 transitions. Word has length 564 [2018-10-15 13:18:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:11,862 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 573 transitions. [2018-10-15 13:18:11,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:18:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 573 transitions. [2018-10-15 13:18:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-15 13:18:11,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:11,865 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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, 1, 1] [2018-10-15 13:18:11,865 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:11,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1500927882, now seen corresponding path program 60 times [2018-10-15 13:18:11,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8221 backedges. 3286 proven. 4935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:15,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:15,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:18:15,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:18:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:18:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=8047, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:18:15,006 INFO L87 Difference]: Start difference. First operand 572 states and 573 transitions. Second operand 99 states. [2018-10-15 13:18:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:24,003 INFO L93 Difference]: Finished difference Result 596 states and 597 transitions. [2018-10-15 13:18:24,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 13:18:24,003 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 571 [2018-10-15 13:18:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:24,005 INFO L225 Difference]: With dead ends: 596 [2018-10-15 13:18:24,005 INFO L226 Difference]: Without dead ends: 596 [2018-10-15 13:18:24,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26715 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14362, Invalid=66010, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 13:18:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-10-15 13:18:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 583. [2018-10-15 13:18:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-10-15 13:18:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-10-15 13:18:24,013 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 571 [2018-10-15 13:18:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:24,013 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-10-15 13:18:24,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:18:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-10-15 13:18:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-10-15 13:18:24,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:24,016 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 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, 1, 1] [2018-10-15 13:18:24,016 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:24,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash -66670637, now seen corresponding path program 61 times [2018-10-15 13:18:24,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 5270 proven. 3286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:29,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:29,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:18:29,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:18:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:18:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2181, Invalid=14849, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:18:29,252 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 131 states. [2018-10-15 13:18:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:43,353 INFO L93 Difference]: Finished difference Result 937 states and 938 transitions. [2018-10-15 13:18:43,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-15 13:18:43,353 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 582 [2018-10-15 13:18:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:43,355 INFO L225 Difference]: With dead ends: 937 [2018-10-15 13:18:43,355 INFO L226 Difference]: Without dead ends: 592 [2018-10-15 13:18:43,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22873 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=13028, Invalid=70782, Unknown=0, NotChecked=0, Total=83810 [2018-10-15 13:18:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-10-15 13:18:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2018-10-15 13:18:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-15 13:18:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 591 transitions. [2018-10-15 13:18:43,361 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 591 transitions. Word has length 582 [2018-10-15 13:18:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:43,361 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 591 transitions. [2018-10-15 13:18:43,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:18:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 591 transitions. [2018-10-15 13:18:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 13:18:43,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:43,364 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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, 1, 1] [2018-10-15 13:18:43,364 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:43,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2095940939, now seen corresponding path program 62 times [2018-10-15 13:18:43,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8774 backedges. 3504 proven. 5270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:46,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:46,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 13:18:46,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 13:18:46,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 13:18:46,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1756, Invalid=8546, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 13:18:46,676 INFO L87 Difference]: Start difference. First operand 590 states and 591 transitions. Second operand 102 states. [2018-10-15 13:18:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:56,419 INFO L93 Difference]: Finished difference Result 614 states and 615 transitions. [2018-10-15 13:18:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-10-15 13:18:56,420 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 589 [2018-10-15 13:18:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:56,423 INFO L225 Difference]: With dead ends: 614 [2018-10-15 13:18:56,423 INFO L226 Difference]: Without dead ends: 614 [2018-10-15 13:18:56,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28473 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15273, Invalid=70283, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 13:18:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-15 13:18:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 601. [2018-10-15 13:18:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-10-15 13:18:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 602 transitions. [2018-10-15 13:18:56,430 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 602 transitions. Word has length 589 [2018-10-15 13:18:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:56,431 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 602 transitions. [2018-10-15 13:18:56,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 13:18:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 602 transitions. [2018-10-15 13:18:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-10-15 13:18:56,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:56,434 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 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, 1, 1] [2018-10-15 13:18:56,434 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:56,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash -550563982, now seen corresponding path program 63 times [2018-10-15 13:18:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 5616 proven. 3504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:02,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:02,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:19:02,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:19:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:19:02,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2315, Invalid=15775, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:19:02,222 INFO L87 Difference]: Start difference. First operand 601 states and 602 transitions. Second operand 135 states. [2018-10-15 13:19:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:17,402 INFO L93 Difference]: Finished difference Result 966 states and 967 transitions. [2018-10-15 13:19:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 13:19:17,403 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 600 [2018-10-15 13:19:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:17,405 INFO L225 Difference]: With dead ends: 966 [2018-10-15 13:19:17,405 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 13:19:17,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24363 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=13831, Invalid=75271, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 13:19:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 13:19:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2018-10-15 13:19:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-15 13:19:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2018-10-15 13:19:17,411 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 600 [2018-10-15 13:19:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:17,411 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2018-10-15 13:19:17,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:19:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2018-10-15 13:19:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-10-15 13:19:17,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:17,414 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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, 1, 1] [2018-10-15 13:19:17,414 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:17,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:17,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1573418730, now seen corresponding path program 64 times [2018-10-15 13:19:17,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9345 backedges. 3729 proven. 5616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:21,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:21,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 13:19:21,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 13:19:21,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 13:19:21,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9060, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:19:21,503 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 105 states. [2018-10-15 13:19:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:31,655 INFO L93 Difference]: Finished difference Result 632 states and 633 transitions. [2018-10-15 13:19:31,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-15 13:19:31,655 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 607 [2018-10-15 13:19:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:31,659 INFO L225 Difference]: With dead ends: 632 [2018-10-15 13:19:31,659 INFO L226 Difference]: Without dead ends: 632 [2018-10-15 13:19:31,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30287 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16212, Invalid=74690, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 13:19:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-15 13:19:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 619. [2018-10-15 13:19:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-15 13:19:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 620 transitions. [2018-10-15 13:19:31,666 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 620 transitions. Word has length 607 [2018-10-15 13:19:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:31,666 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 620 transitions. [2018-10-15 13:19:31,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 13:19:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 620 transitions. [2018-10-15 13:19:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-15 13:19:31,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:31,669 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 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, 1, 1] [2018-10-15 13:19:31,670 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:31,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash -702991245, now seen corresponding path program 65 times [2018-10-15 13:19:31,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 5973 proven. 3729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:37,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:37,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:19:37,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:19:37,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:19:37,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2453, Invalid=16729, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:19:37,314 INFO L87 Difference]: Start difference. First operand 619 states and 620 transitions. Second operand 139 states. [2018-10-15 13:19:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:53,178 INFO L93 Difference]: Finished difference Result 995 states and 996 transitions. [2018-10-15 13:19:53,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-10-15 13:19:53,178 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 618 [2018-10-15 13:19:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:53,180 INFO L225 Difference]: With dead ends: 995 [2018-10-15 13:19:53,180 INFO L226 Difference]: Without dead ends: 628 [2018-10-15 13:19:53,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25900 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=14658, Invalid=79898, Unknown=0, NotChecked=0, Total=94556 [2018-10-15 13:19:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-15 13:19:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2018-10-15 13:19:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-15 13:19:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 627 transitions. [2018-10-15 13:19:53,186 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 627 transitions. Word has length 618 [2018-10-15 13:19:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:53,187 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 627 transitions. [2018-10-15 13:19:53,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:19:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 627 transitions. [2018-10-15 13:19:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-10-15 13:19:53,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:53,190 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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, 1, 1] [2018-10-15 13:19:53,190 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:53,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash 899984875, now seen corresponding path program 66 times [2018-10-15 13:19:53,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9934 backedges. 3961 proven. 5973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:56,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:56,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 13:19:56,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 13:19:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 13:19:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1967, Invalid=9589, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 13:19:56,499 INFO L87 Difference]: Start difference. First operand 626 states and 627 transitions. Second operand 108 states. [2018-10-15 13:20:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:06,355 INFO L93 Difference]: Finished difference Result 650 states and 651 transitions. [2018-10-15 13:20:06,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-15 13:20:06,355 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 625 [2018-10-15 13:20:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:06,358 INFO L225 Difference]: With dead ends: 650 [2018-10-15 13:20:06,358 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 13:20:06,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32157 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=17179, Invalid=79231, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 13:20:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 13:20:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 637. [2018-10-15 13:20:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-10-15 13:20:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 638 transitions. [2018-10-15 13:20:06,366 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 638 transitions. Word has length 625 [2018-10-15 13:20:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:06,366 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 638 transitions. [2018-10-15 13:20:06,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 13:20:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 638 transitions. [2018-10-15 13:20:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-10-15 13:20:06,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:06,369 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 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, 1, 1] [2018-10-15 13:20:06,369 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:06,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:06,370 INFO L82 PathProgramCache]: Analyzing trace with hash -285850926, now seen corresponding path program 67 times [2018-10-15 13:20:06,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 6341 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:12,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:12,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:20:12,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:20:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:20:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2595, Invalid=17711, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:20:12,663 INFO L87 Difference]: Start difference. First operand 637 states and 638 transitions. Second operand 143 states. [2018-10-15 13:20:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:29,711 INFO L93 Difference]: Finished difference Result 1024 states and 1025 transitions. [2018-10-15 13:20:29,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-15 13:20:29,711 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 636 [2018-10-15 13:20:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:29,713 INFO L225 Difference]: With dead ends: 1024 [2018-10-15 13:20:29,713 INFO L226 Difference]: Without dead ends: 646 [2018-10-15 13:20:29,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27484 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=15509, Invalid=84663, Unknown=0, NotChecked=0, Total=100172 [2018-10-15 13:20:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-10-15 13:20:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2018-10-15 13:20:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-10-15 13:20:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 645 transitions. [2018-10-15 13:20:29,719 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 645 transitions. Word has length 636 [2018-10-15 13:20:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:29,719 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 645 transitions. [2018-10-15 13:20:29,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:20:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 645 transitions. [2018-10-15 13:20:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-10-15 13:20:29,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:29,722 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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, 1, 1] [2018-10-15 13:20:29,722 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:29,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:29,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1848422838, now seen corresponding path program 68 times [2018-10-15 13:20:29,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10541 backedges. 4200 proven. 6341 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:33,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:33,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 13:20:33,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 13:20:33,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 13:20:33,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=10133, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:20:33,464 INFO L87 Difference]: Start difference. First operand 644 states and 645 transitions. Second operand 111 states. [2018-10-15 13:20:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:43,826 INFO L93 Difference]: Finished difference Result 668 states and 669 transitions. [2018-10-15 13:20:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-10-15 13:20:43,826 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 643 [2018-10-15 13:20:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:43,829 INFO L225 Difference]: With dead ends: 668 [2018-10-15 13:20:43,829 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 13:20:43,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34083 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18174, Invalid=83906, Unknown=0, NotChecked=0, Total=102080 [2018-10-15 13:20:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 13:20:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 655. [2018-10-15 13:20:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-10-15 13:20:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2018-10-15 13:20:43,836 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 643 [2018-10-15 13:20:43,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:43,837 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2018-10-15 13:20:43,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 13:20:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2018-10-15 13:20:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-10-15 13:20:43,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:43,840 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 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, 1, 1] [2018-10-15 13:20:43,840 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:43,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1404042989, now seen corresponding path program 69 times [2018-10-15 13:20:43,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat