java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/seq_true-unreach-call_true-termination.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:43:18,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:43:18,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:43:18,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:43:18,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:43:18,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:43:18,926 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:43:18,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:43:18,930 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:43:18,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:43:18,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:43:18,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:43:18,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:43:18,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:43:18,942 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:43:18,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:43:18,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:43:18,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:43:18,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:43:18,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:43:18,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:43:18,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:43:18,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:43:18,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:43:18,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:43:18,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:43:18,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:43:18,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:43:18,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:43:18,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:43:18,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:43:18,974 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:43:18,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:43:18,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:43:18,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:43:18,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:43:18,976 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:43:18,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:43:18,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:43:18,995 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:43:18,999 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:43:18,999 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:43:18,999 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:43:19,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:43:19,000 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:43:19,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:43:19,001 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:43:19,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:43:19,001 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:43:19,001 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:43:19,003 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:43:19,003 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:43:19,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:43:19,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:43:19,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:43:19,095 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:43:19,095 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:43:19,096 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 12:43:19,097 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 12:43:19,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:43:19,177 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:43:19,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:43:19,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:43:19,178 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:43:19,208 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 12:43:19" (1/1) ... [2018-10-15 12:43:19,210 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 12:43:19" (1/1) ... [2018-10-15 12:43:19,221 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 12:43:19" (1/1) ... [2018-10-15 12:43:19,222 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 12:43:19" (1/1) ... [2018-10-15 12:43:19,227 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 12:43:19" (1/1) ... [2018-10-15 12:43:19,229 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 12:43:19" (1/1) ... [2018-10-15 12:43:19,232 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 12:43:19" (1/1) ... [2018-10-15 12:43:19,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:43:19,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:43:19,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:43:19,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:43:19,241 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 12:43:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 12:43:19,319 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:43:19,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:43:19,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:43:19,842 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:43:19,843 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 12:43:19 BoogieIcfgContainer [2018-10-15 12:43:19,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:43:19,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:43:19,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:43:19,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:43:19,849 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 12:43:19" (1/2) ... [2018-10-15 12:43:19,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36640d15 and model type seq_true-unreach-call_true-termination.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:43:19, skipping insertion in model container [2018-10-15 12:43:19,850 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 12:43:19" (2/2) ... [2018-10-15 12:43:19,852 INFO L112 eAbstractionObserver]: Analyzing ICFG seq_true-unreach-call_true-termination.i_7.bpl [2018-10-15 12:43:19,862 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:43:19,870 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:43:19,886 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:43:19,916 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:43:19,917 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:43:19,917 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:43:19,917 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:43:19,917 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:43:19,918 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:43:19,918 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:43:19,918 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:43:19,918 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:43:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-15 12:43:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 12:43:19,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:19,947 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 12:43:19,948 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:19,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2129214634, now seen corresponding path program 1 times [2018-10-15 12:43:20,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:20,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:43:20,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 12:43:20,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:43:20,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:43:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:43:20,294 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 7 states. [2018-10-15 12:43:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:20,783 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-10-15 12:43:20,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:43:20,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-15 12:43:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:20,805 INFO L225 Difference]: With dead ends: 44 [2018-10-15 12:43:20,805 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 12:43:20,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:43:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 12:43:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-10-15 12:43:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 12:43:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-10-15 12:43:20,859 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 24 [2018-10-15 12:43:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:20,860 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-10-15 12:43:20,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:43:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-10-15 12:43:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 12:43:20,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:20,864 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 12:43:20,865 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:20,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1984988896, now seen corresponding path program 1 times [2018-10-15 12:43:20,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:21,009 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 12:43:21,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:43:21,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 12:43:21,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:43:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:43:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:43:21,013 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 7 states. [2018-10-15 12:43:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:21,285 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-10-15 12:43:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:43:21,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-10-15 12:43:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:21,287 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:43:21,287 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 12:43:21,289 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 12:43:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 12:43:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-10-15 12:43:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:43:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-15 12:43:21,298 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 31 [2018-10-15 12:43:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:21,299 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-15 12:43:21,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:43:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-15 12:43:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:43:21,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:21,301 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 12:43:21,301 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:21,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1673837377, now seen corresponding path program 1 times [2018-10-15 12:43:21,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:21,566 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 12:43:21,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:21,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:43:21,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:43:21,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:43:21,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:43:21,569 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 11 states. [2018-10-15 12:43:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:22,365 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-10-15 12:43:22,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:43:22,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-10-15 12:43:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:22,369 INFO L225 Difference]: With dead ends: 67 [2018-10-15 12:43:22,370 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 12:43:22,371 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 12:43:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 12:43:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-10-15 12:43:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 12:43:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-10-15 12:43:22,377 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 42 [2018-10-15 12:43:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:22,378 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-10-15 12:43:22,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:43:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-10-15 12:43:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:43:22,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:22,380 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 12:43:22,381 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:22,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash 904614539, now seen corresponding path program 2 times [2018-10-15 12:43:22,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:22,605 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 12:43:22,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:22,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:43:22,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:43:22,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:43:22,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:43:22,607 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 12 states. [2018-10-15 12:43:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:23,050 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-10-15 12:43:23,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:43:23,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-10-15 12:43:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:23,060 INFO L225 Difference]: With dead ends: 74 [2018-10-15 12:43:23,061 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 12:43:23,061 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 12:43:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 12:43:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-10-15 12:43:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:43:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-10-15 12:43:23,074 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 49 [2018-10-15 12:43:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:23,077 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-10-15 12:43:23,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:43:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-10-15 12:43:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 12:43:23,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:23,080 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 12:43:23,083 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:23,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:23,084 INFO L82 PathProgramCache]: Analyzing trace with hash 555180278, now seen corresponding path program 3 times [2018-10-15 12:43:23,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:23,523 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 12:43:23,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:23,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:43:23,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:43:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:43:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:43:23,525 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 15 states. [2018-10-15 12:43:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:24,049 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-10-15 12:43:24,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:43:24,049 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-10-15 12:43:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:24,051 INFO L225 Difference]: With dead ends: 96 [2018-10-15 12:43:24,051 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 12:43:24,052 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 12:43:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 12:43:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-15 12:43:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-15 12:43:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-10-15 12:43:24,059 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 60 [2018-10-15 12:43:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:24,060 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-10-15 12:43:24,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:43:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-10-15 12:43:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 12:43:24,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:24,065 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 12:43:24,066 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:24,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash -391743040, now seen corresponding path program 4 times [2018-10-15 12:43:24,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:24,430 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 12:43:24,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:24,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:43:24,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:43:24,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:43:24,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:43:24,433 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2018-10-15 12:43:24,934 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-10-15 12:43:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:25,111 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-10-15 12:43:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:43:25,113 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-10-15 12:43:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:25,115 INFO L225 Difference]: With dead ends: 92 [2018-10-15 12:43:25,115 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 12:43:25,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:43:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 12:43:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2018-10-15 12:43:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 12:43:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-10-15 12:43:25,123 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 67 [2018-10-15 12:43:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:25,124 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-10-15 12:43:25,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:43:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-10-15 12:43:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 12:43:25,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:25,126 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 12:43:25,126 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:25,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1552607583, now seen corresponding path program 5 times [2018-10-15 12:43:25,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:25,412 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 12:43:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:25,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:43:25,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:43:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:43:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:43:25,415 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 19 states. [2018-10-15 12:43:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:26,298 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-10-15 12:43:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:43:26,298 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-10-15 12:43:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:26,300 INFO L225 Difference]: With dead ends: 125 [2018-10-15 12:43:26,300 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 12:43:26,301 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 12:43:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 12:43:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-10-15 12:43:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 12:43:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-10-15 12:43:26,308 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 78 [2018-10-15 12:43:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:26,308 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-10-15 12:43:26,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:43:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-10-15 12:43:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 12:43:26,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:26,310 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 12:43:26,311 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:26,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2032185109, now seen corresponding path program 6 times [2018-10-15 12:43:26,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:26,600 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 12:43:26,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:26,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:43:26,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:43:26,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:43:26,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:43:26,602 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 18 states. [2018-10-15 12:43:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:27,178 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2018-10-15 12:43:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:43:27,178 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 85 [2018-10-15 12:43:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:27,181 INFO L225 Difference]: With dead ends: 110 [2018-10-15 12:43:27,181 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 12:43:27,182 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 12:43:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 12:43:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2018-10-15 12:43:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 12:43:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-10-15 12:43:27,189 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 85 [2018-10-15 12:43:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:27,190 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-10-15 12:43:27,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:43:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-10-15 12:43:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 12:43:27,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:27,192 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 12:43:27,192 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:27,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash -285825386, now seen corresponding path program 7 times [2018-10-15 12:43:27,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:27,490 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 12:43:27,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:27,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:43:27,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:43:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:43:27,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:43:27,492 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 23 states. [2018-10-15 12:43:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:28,148 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2018-10-15 12:43:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:43:28,149 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2018-10-15 12:43:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:28,151 INFO L225 Difference]: With dead ends: 154 [2018-10-15 12:43:28,151 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 12:43:28,152 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 12:43:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 12:43:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-15 12:43:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 12:43:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-10-15 12:43:28,158 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 96 [2018-10-15 12:43:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:28,159 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-10-15 12:43:28,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:43:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-10-15 12:43:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 12:43:28,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:28,161 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 12:43:28,161 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:28,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1723424160, now seen corresponding path program 8 times [2018-10-15 12:43:28,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:28,439 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 12:43:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:28,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:43:28,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:43:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:43:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:43:28,441 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2018-10-15 12:43:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:29,248 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2018-10-15 12:43:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:43:29,249 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2018-10-15 12:43:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:29,251 INFO L225 Difference]: With dead ends: 128 [2018-10-15 12:43:29,251 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 12:43:29,252 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 12:43:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 12:43:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2018-10-15 12:43:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:43:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-10-15 12:43:29,259 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 103 [2018-10-15 12:43:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:29,259 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-10-15 12:43:29,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:43:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-10-15 12:43:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:43:29,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:29,261 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 12:43:29,261 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:29,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash -541898239, now seen corresponding path program 9 times [2018-10-15 12:43:29,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:30,116 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 12:43:30,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:30,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:43:30,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:43:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:43:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:43:30,118 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 27 states. [2018-10-15 12:43:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:31,202 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-10-15 12:43:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:43:31,203 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 114 [2018-10-15 12:43:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:31,204 INFO L225 Difference]: With dead ends: 183 [2018-10-15 12:43:31,205 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 12:43:31,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=574, Invalid=2506, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 12:43:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 12:43:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-15 12:43:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 12:43:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-10-15 12:43:31,217 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 114 [2018-10-15 12:43:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:31,217 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-10-15 12:43:31,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:43:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-10-15 12:43:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:43:31,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:31,219 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 12:43:31,220 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:31,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1970559157, now seen corresponding path program 10 times [2018-10-15 12:43:31,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:31,578 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 12:43:31,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:31,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 12:43:31,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 12:43:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 12:43:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:43:31,580 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 24 states. [2018-10-15 12:43:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:32,389 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2018-10-15 12:43:32,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:43:32,389 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 121 [2018-10-15 12:43:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:32,391 INFO L225 Difference]: With dead ends: 146 [2018-10-15 12:43:32,391 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 12:43:32,393 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 12:43:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 12:43:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2018-10-15 12:43:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 12:43:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-10-15 12:43:32,397 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 121 [2018-10-15 12:43:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:32,398 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-10-15 12:43:32,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 12:43:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-10-15 12:43:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 12:43:32,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:32,400 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 12:43:32,400 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:32,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:32,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1208576970, now seen corresponding path program 11 times [2018-10-15 12:43:32,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:32,865 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 12:43:32,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:32,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:43:32,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:43:32,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:43:32,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:43:32,867 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 31 states. [2018-10-15 12:43:33,597 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-15 12:43:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:34,246 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-10-15 12:43:34,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:43:34,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 132 [2018-10-15 12:43:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:34,248 INFO L225 Difference]: With dead ends: 212 [2018-10-15 12:43:34,248 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 12:43:34,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=753, Invalid=3407, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:43:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 12:43:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-15 12:43:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:43:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-10-15 12:43:34,253 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 132 [2018-10-15 12:43:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:34,253 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-10-15 12:43:34,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:43:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-10-15 12:43:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:43:34,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:34,255 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 12:43:34,255 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:34,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:34,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1248726272, now seen corresponding path program 12 times [2018-10-15 12:43:34,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:34,728 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 12:43:34,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:34,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:43:34,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:43:34,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:43:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:43:34,730 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 27 states. [2018-10-15 12:43:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:36,289 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2018-10-15 12:43:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:43:36,290 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 139 [2018-10-15 12:43:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:36,291 INFO L225 Difference]: With dead ends: 164 [2018-10-15 12:43:36,291 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 12:43:36,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=898, Invalid=3658, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:43:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 12:43:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2018-10-15 12:43:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 12:43:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-10-15 12:43:36,297 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 139 [2018-10-15 12:43:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:36,298 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-10-15 12:43:36,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:43:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-10-15 12:43:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 12:43:36,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:36,300 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 12:43:36,300 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:36,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash 155014497, now seen corresponding path program 13 times [2018-10-15 12:43:36,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:37,513 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 12:43:37,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:37,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:43:37,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:43:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:43:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:43:37,515 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 35 states. [2018-10-15 12:43:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:38,649 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2018-10-15 12:43:38,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:43:38,649 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 150 [2018-10-15 12:43:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:38,651 INFO L225 Difference]: With dead ends: 241 [2018-10-15 12:43:38,651 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 12:43:38,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=956, Invalid=4446, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:43:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 12:43:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-10-15 12:43:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 12:43:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-10-15 12:43:38,656 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 150 [2018-10-15 12:43:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:38,657 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-10-15 12:43:38,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:43:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-10-15 12:43:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:43:38,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:38,658 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 12:43:38,658 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:38,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash -831629909, now seen corresponding path program 14 times [2018-10-15 12:43:38,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:39,097 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 12:43:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 12:43:39,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 12:43:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 12:43:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:43:39,099 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 30 states. [2018-10-15 12:43:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:40,389 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-10-15 12:43:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:43:40,391 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 157 [2018-10-15 12:43:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:40,392 INFO L225 Difference]: With dead ends: 182 [2018-10-15 12:43:40,392 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 12:43:40,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1137, Invalid=4715, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:43:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 12:43:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-10-15 12:43:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 12:43:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-10-15 12:43:40,397 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 157 [2018-10-15 12:43:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:40,398 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-10-15 12:43:40,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 12:43:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-10-15 12:43:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 12:43:40,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:40,399 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 12:43:40,399 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:40,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 869870038, now seen corresponding path program 15 times [2018-10-15 12:43:40,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:41,261 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 12:43:41,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:41,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:43:41,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:43:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:43:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:43:41,262 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 39 states. [2018-10-15 12:43:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:42,929 INFO L93 Difference]: Finished difference Result 270 states and 271 transitions. [2018-10-15 12:43:42,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:43:42,929 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 168 [2018-10-15 12:43:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:42,931 INFO L225 Difference]: With dead ends: 270 [2018-10-15 12:43:42,931 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 12:43:42,933 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 12:43:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 12:43:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-10-15 12:43:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 12:43:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-10-15 12:43:42,937 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 168 [2018-10-15 12:43:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:42,937 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-10-15 12:43:42,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:43:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-10-15 12:43:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:43:42,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:42,939 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 12:43:42,939 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:42,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash -502633568, now seen corresponding path program 16 times [2018-10-15 12:43:42,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:43,594 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 12:43:43,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:43,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:43:43,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:43:43,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:43:43,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:43:43,596 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 33 states. [2018-10-15 12:43:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:44,750 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2018-10-15 12:43:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:43:44,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 175 [2018-10-15 12:43:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:44,752 INFO L225 Difference]: With dead ends: 200 [2018-10-15 12:43:44,752 INFO L226 Difference]: Without dead ends: 200 [2018-10-15 12:43:44,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1404, Invalid=5906, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:43:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-15 12:43:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2018-10-15 12:43:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 12:43:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-15 12:43:44,760 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 175 [2018-10-15 12:43:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:44,760 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-15 12:43:44,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:43:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-15 12:43:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 12:43:44,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:44,762 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 12:43:44,762 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:44,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:44,762 INFO L82 PathProgramCache]: Analyzing trace with hash -162449215, now seen corresponding path program 17 times [2018-10-15 12:43:44,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:46,120 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 12:43:46,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:43:46,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:43:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:43:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1561, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:43:46,122 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 43 states. [2018-10-15 12:43:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:48,546 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-10-15 12:43:48,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 12:43:48,547 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 186 [2018-10-15 12:43:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:48,548 INFO L225 Difference]: With dead ends: 299 [2018-10-15 12:43:48,548 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 12:43:48,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1434, Invalid=6938, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 12:43:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 12:43:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-10-15 12:43:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 12:43:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-10-15 12:43:48,553 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 186 [2018-10-15 12:43:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:48,553 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-10-15 12:43:48,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:43:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-10-15 12:43:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:43:48,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:48,554 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 12:43:48,555 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:48,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1703238667, now seen corresponding path program 18 times [2018-10-15 12:43:48,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:49,370 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 12:43:49,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:49,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 12:43:49,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 12:43:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 12:43:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:43:49,372 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 36 states. [2018-10-15 12:43:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:51,028 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2018-10-15 12:43:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:43:51,028 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 193 [2018-10-15 12:43:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:51,029 INFO L225 Difference]: With dead ends: 218 [2018-10-15 12:43:51,030 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 12:43:51,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1699, Invalid=7231, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:43:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 12:43:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2018-10-15 12:43:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 12:43:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-10-15 12:43:51,035 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 193 [2018-10-15 12:43:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:51,036 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-10-15 12:43:51,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 12:43:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-10-15 12:43:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 12:43:51,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:51,037 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 12:43:51,037 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:51,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:51,038 INFO L82 PathProgramCache]: Analyzing trace with hash 618686326, now seen corresponding path program 19 times [2018-10-15 12:43:51,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:51,912 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 12:43:51,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:51,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:43:51,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:43:51,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:43:51,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:43:51,913 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 47 states. [2018-10-15 12:43:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:55,685 INFO L93 Difference]: Finished difference Result 328 states and 329 transitions. [2018-10-15 12:43:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:43:55,685 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 204 [2018-10-15 12:43:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:55,687 INFO L225 Difference]: With dead ends: 328 [2018-10-15 12:43:55,687 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 12:43:55,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1709, Invalid=8391, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:43:55,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 12:43:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-15 12:43:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-15 12:43:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-10-15 12:43:55,693 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 204 [2018-10-15 12:43:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:55,694 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-10-15 12:43:55,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:43:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-10-15 12:43:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-15 12:43:55,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:55,695 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 12:43:55,696 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:55,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1840385088, now seen corresponding path program 20 times [2018-10-15 12:43:55,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:56,513 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 12:43:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:56,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:43:56,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:43:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:43:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:43:56,515 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 39 states. [2018-10-15 12:43:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:58,139 INFO L93 Difference]: Finished difference Result 236 states and 237 transitions. [2018-10-15 12:43:58,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:43:58,141 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 211 [2018-10-15 12:43:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:58,142 INFO L225 Difference]: With dead ends: 236 [2018-10-15 12:43:58,142 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 12:43:58,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2022, Invalid=8690, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 12:43:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 12:43:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2018-10-15 12:43:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 12:43:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-10-15 12:43:58,148 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 211 [2018-10-15 12:43:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:58,148 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-10-15 12:43:58,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:43:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-10-15 12:43:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 12:43:58,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:58,150 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 12:43:58,150 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:58,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1118630945, now seen corresponding path program 21 times [2018-10-15 12:43:58,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:59,091 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 12:43:59,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:59,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:43:59,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:43:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:43:59,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:43:59,093 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 51 states. [2018-10-15 12:44:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:01,651 INFO L93 Difference]: Finished difference Result 357 states and 358 transitions. [2018-10-15 12:44:01,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:44:01,651 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 222 [2018-10-15 12:44:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:01,653 INFO L225 Difference]: With dead ends: 357 [2018-10-15 12:44:01,654 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 12:44:01,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2943 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2008, Invalid=9982, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 12:44:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 12:44:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-15 12:44:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 12:44:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-10-15 12:44:01,659 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 222 [2018-10-15 12:44:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:01,659 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-10-15 12:44:01,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:44:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-10-15 12:44:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 12:44:01,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:01,661 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 12:44:01,661 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:01,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash -934364565, now seen corresponding path program 22 times [2018-10-15 12:44:01,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:02,344 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 12:44:02,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:02,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:44:02,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:44:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:44:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:44:02,346 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 42 states. [2018-10-15 12:44:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:04,281 INFO L93 Difference]: Finished difference Result 254 states and 255 transitions. [2018-10-15 12:44:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:44:04,285 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 229 [2018-10-15 12:44:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:04,286 INFO L225 Difference]: With dead ends: 254 [2018-10-15 12:44:04,286 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 12:44:04,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2373, Invalid=10283, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:44:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 12:44:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2018-10-15 12:44:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 12:44:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-10-15 12:44:04,292 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 229 [2018-10-15 12:44:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:04,293 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-10-15 12:44:04,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:44:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-10-15 12:44:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 12:44:04,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:04,294 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 12:44:04,294 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:04,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2010008854, now seen corresponding path program 23 times [2018-10-15 12:44:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:05,804 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 12:44:05,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:05,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:44:05,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:44:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:44:05,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2575, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:44:05,806 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 55 states. [2018-10-15 12:44:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:08,462 INFO L93 Difference]: Finished difference Result 386 states and 387 transitions. [2018-10-15 12:44:08,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:44:08,463 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 240 [2018-10-15 12:44:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:08,464 INFO L225 Difference]: With dead ends: 386 [2018-10-15 12:44:08,464 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 12:44:08,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3493 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2331, Invalid=11711, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:44:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 12:44:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-15 12:44:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:44:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-10-15 12:44:08,470 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 240 [2018-10-15 12:44:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:08,470 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-10-15 12:44:08,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:44:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-10-15 12:44:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 12:44:08,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:08,472 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 12:44:08,472 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:08,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1913312480, now seen corresponding path program 24 times [2018-10-15 12:44:08,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:09,218 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 12:44:09,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:09,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:44:09,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:44:09,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:44:09,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:44:09,219 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 45 states. [2018-10-15 12:44:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:11,470 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-10-15 12:44:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 12:44:11,470 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 247 [2018-10-15 12:44:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:11,473 INFO L225 Difference]: With dead ends: 272 [2018-10-15 12:44:11,473 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 12:44:11,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2752, Invalid=12010, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 12:44:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 12:44:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2018-10-15 12:44:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 12:44:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-15 12:44:11,479 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 247 [2018-10-15 12:44:11,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:11,479 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-15 12:44:11,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:44:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-15 12:44:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 12:44:11,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:11,481 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 12:44:11,481 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:11,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:11,481 INFO L82 PathProgramCache]: Analyzing trace with hash 797869953, now seen corresponding path program 25 times [2018-10-15 12:44:11,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:13,011 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 12:44:13,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:13,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:44:13,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:44:13,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:44:13,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2969, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:44:13,013 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 59 states. [2018-10-15 12:44:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:15,916 INFO L93 Difference]: Finished difference Result 415 states and 416 transitions. [2018-10-15 12:44:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 12:44:15,916 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 258 [2018-10-15 12:44:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:15,918 INFO L225 Difference]: With dead ends: 415 [2018-10-15 12:44:15,918 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 12:44:15,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4090 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2678, Invalid=13578, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 12:44:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 12:44:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-10-15 12:44:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:44:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2018-10-15 12:44:15,921 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 258 [2018-10-15 12:44:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:15,922 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2018-10-15 12:44:15,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:44:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2018-10-15 12:44:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 12:44:15,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:15,923 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 12:44:15,923 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:15,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1261932341, now seen corresponding path program 26 times [2018-10-15 12:44:15,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:17,796 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 12:44:17,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:17,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:44:17,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:44:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:44:17,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:44:17,797 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 48 states. [2018-10-15 12:44:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:20,085 INFO L93 Difference]: Finished difference Result 290 states and 291 transitions. [2018-10-15 12:44:20,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 12:44:20,085 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 265 [2018-10-15 12:44:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:20,087 INFO L225 Difference]: With dead ends: 290 [2018-10-15 12:44:20,087 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 12:44:20,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3159, Invalid=13871, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:44:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 12:44:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 277. [2018-10-15 12:44:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 12:44:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-10-15 12:44:20,093 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 265 [2018-10-15 12:44:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:20,094 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-10-15 12:44:20,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:44:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-10-15 12:44:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 12:44:20,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:20,095 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 12:44:20,096 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:20,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1675942582, now seen corresponding path program 27 times [2018-10-15 12:44:20,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:22,887 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 12:44:22,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:22,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:44:22,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:44:22,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:44:22,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3391, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:44:22,889 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 63 states. [2018-10-15 12:44:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:26,375 INFO L93 Difference]: Finished difference Result 444 states and 445 transitions. [2018-10-15 12:44:26,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 12:44:26,375 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 276 [2018-10-15 12:44:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:26,377 INFO L225 Difference]: With dead ends: 444 [2018-10-15 12:44:26,377 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 12:44:26,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4734 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3049, Invalid=15583, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:44:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 12:44:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-15 12:44:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:44:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 285 transitions. [2018-10-15 12:44:26,382 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 285 transitions. Word has length 276 [2018-10-15 12:44:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:26,382 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 285 transitions. [2018-10-15 12:44:26,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:44:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 285 transitions. [2018-10-15 12:44:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-15 12:44:26,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:26,384 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 12:44:26,384 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:26,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash -216611456, now seen corresponding path program 28 times [2018-10-15 12:44:26,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:27,283 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 12:44:27,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:27,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:44:27,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:44:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:44:27,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:44:27,285 INFO L87 Difference]: Start difference. First operand 284 states and 285 transitions. Second operand 51 states. [2018-10-15 12:44:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:29,751 INFO L93 Difference]: Finished difference Result 308 states and 309 transitions. [2018-10-15 12:44:29,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:44:29,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 283 [2018-10-15 12:44:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:29,753 INFO L225 Difference]: With dead ends: 308 [2018-10-15 12:44:29,753 INFO L226 Difference]: Without dead ends: 308 [2018-10-15 12:44:29,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6203 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3594, Invalid=15866, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 12:44:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-15 12:44:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2018-10-15 12:44:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 12:44:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-15 12:44:29,759 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 283 [2018-10-15 12:44:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:29,759 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-15 12:44:29,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:44:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-15 12:44:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 12:44:29,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:29,761 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 12:44:29,761 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:29,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2085358879, now seen corresponding path program 29 times [2018-10-15 12:44:29,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:31,991 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 12:44:31,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:31,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:44:31,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:44:31,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:44:31,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=3841, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:44:31,992 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 67 states. [2018-10-15 12:44:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:35,675 INFO L93 Difference]: Finished difference Result 473 states and 474 transitions. [2018-10-15 12:44:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 12:44:35,675 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 294 [2018-10-15 12:44:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:35,676 INFO L225 Difference]: With dead ends: 473 [2018-10-15 12:44:35,677 INFO L226 Difference]: Without dead ends: 304 [2018-10-15 12:44:35,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5425 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3444, Invalid=17726, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 12:44:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-15 12:44:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2018-10-15 12:44:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 12:44:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2018-10-15 12:44:35,682 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 294 [2018-10-15 12:44:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:35,682 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2018-10-15 12:44:35,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:44:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2018-10-15 12:44:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 12:44:35,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:35,684 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 12:44:35,685 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:35,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:35,685 INFO L82 PathProgramCache]: Analyzing trace with hash 242253611, now seen corresponding path program 30 times [2018-10-15 12:44:35,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:36,995 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 12:44:36,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:36,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 12:44:36,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 12:44:36,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 12:44:36,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:44:36,997 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 54 states. [2018-10-15 12:44:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:39,767 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-15 12:44:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 12:44:39,768 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 301 [2018-10-15 12:44:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:39,770 INFO L225 Difference]: With dead ends: 326 [2018-10-15 12:44:39,771 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 12:44:39,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7065 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4057, Invalid=17995, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 12:44:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 12:44:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2018-10-15 12:44:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 12:44:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-10-15 12:44:39,777 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 301 [2018-10-15 12:44:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:39,778 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-10-15 12:44:39,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 12:44:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-10-15 12:44:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 12:44:39,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:39,780 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 12:44:39,780 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:39,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1964634026, now seen corresponding path program 31 times [2018-10-15 12:44:39,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:41,475 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 12:44:41,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:41,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:44:41,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:44:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:44:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=4319, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:44:41,477 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 71 states. [2018-10-15 12:44:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:44,905 INFO L93 Difference]: Finished difference Result 502 states and 503 transitions. [2018-10-15 12:44:44,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 12:44:44,905 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 312 [2018-10-15 12:44:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:44,907 INFO L225 Difference]: With dead ends: 502 [2018-10-15 12:44:44,907 INFO L226 Difference]: Without dead ends: 322 [2018-10-15 12:44:44,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6163 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3863, Invalid=20007, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:44:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-15 12:44:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-15 12:44:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 12:44:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2018-10-15 12:44:44,913 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 312 [2018-10-15 12:44:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:44,913 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2018-10-15 12:44:44,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:44:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2018-10-15 12:44:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 12:44:44,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:44,915 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 12:44:44,915 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:44,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:44,916 INFO L82 PathProgramCache]: Analyzing trace with hash -11018720, now seen corresponding path program 32 times [2018-10-15 12:44:44,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:45,962 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 12:44:45,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:45,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:44:45,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:44:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:44:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:44:45,964 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 57 states. [2018-10-15 12:44:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:49,197 INFO L93 Difference]: Finished difference Result 344 states and 345 transitions. [2018-10-15 12:44:49,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 12:44:49,197 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 319 [2018-10-15 12:44:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:49,200 INFO L225 Difference]: With dead ends: 344 [2018-10-15 12:44:49,200 INFO L226 Difference]: Without dead ends: 344 [2018-10-15 12:44:49,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7983 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4548, Invalid=20258, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 12:44:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-15 12:44:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2018-10-15 12:44:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 12:44:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-10-15 12:44:49,207 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 319 [2018-10-15 12:44:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:49,207 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-10-15 12:44:49,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:44:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-10-15 12:44:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-15 12:44:49,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:49,209 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 12:44:49,210 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:49,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1801139777, now seen corresponding path program 33 times [2018-10-15 12:44:49,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:52,198 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 12:44:52,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:52,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:44:52,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:44:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:44:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=4825, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:44:52,200 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 75 states. [2018-10-15 12:44:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:56,695 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-10-15 12:44:56,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 12:44:56,695 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 330 [2018-10-15 12:44:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:56,697 INFO L225 Difference]: With dead ends: 531 [2018-10-15 12:44:56,697 INFO L226 Difference]: Without dead ends: 340 [2018-10-15 12:44:56,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6948 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4306, Invalid=22426, Unknown=0, NotChecked=0, Total=26732 [2018-10-15 12:44:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-15 12:44:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2018-10-15 12:44:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-15 12:44:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 339 transitions. [2018-10-15 12:44:56,702 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 339 transitions. Word has length 330 [2018-10-15 12:44:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:56,702 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 339 transitions. [2018-10-15 12:44:56,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:44:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 339 transitions. [2018-10-15 12:44:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-15 12:44:56,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:56,704 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 12:44:56,704 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:56,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:56,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1102781045, now seen corresponding path program 34 times [2018-10-15 12:44:56,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:58,000 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 12:44:58,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:58,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 12:44:58,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 12:44:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 12:44:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:44:58,002 INFO L87 Difference]: Start difference. First operand 338 states and 339 transitions. Second operand 60 states. [2018-10-15 12:45:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:01,358 INFO L93 Difference]: Finished difference Result 362 states and 363 transitions. [2018-10-15 12:45:01,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:45:01,359 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 337 [2018-10-15 12:45:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:01,360 INFO L225 Difference]: With dead ends: 362 [2018-10-15 12:45:01,360 INFO L226 Difference]: Without dead ends: 362 [2018-10-15 12:45:01,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8957 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5067, Invalid=22655, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:45:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-15 12:45:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 349. [2018-10-15 12:45:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 12:45:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-10-15 12:45:01,367 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 337 [2018-10-15 12:45:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:01,367 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-10-15 12:45:01,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 12:45:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-10-15 12:45:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 12:45:01,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:01,369 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 12:45:01,370 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:01,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash 420736502, now seen corresponding path program 35 times [2018-10-15 12:45:01,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:04,132 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 12:45:04,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:04,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:45:04,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:45:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:45:04,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=5359, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:45:04,134 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 79 states. [2018-10-15 12:45:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:08,527 INFO L93 Difference]: Finished difference Result 560 states and 561 transitions. [2018-10-15 12:45:08,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 12:45:08,528 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 348 [2018-10-15 12:45:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:08,529 INFO L225 Difference]: With dead ends: 560 [2018-10-15 12:45:08,529 INFO L226 Difference]: Without dead ends: 358 [2018-10-15 12:45:08,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7780 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4773, Invalid=24983, Unknown=0, NotChecked=0, Total=29756 [2018-10-15 12:45:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-15 12:45:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-10-15 12:45:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-15 12:45:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-10-15 12:45:08,534 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 348 [2018-10-15 12:45:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:08,534 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-10-15 12:45:08,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:45:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-10-15 12:45:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-15 12:45:08,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:08,537 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 12:45:08,537 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:08,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:08,537 INFO L82 PathProgramCache]: Analyzing trace with hash -808444224, now seen corresponding path program 36 times [2018-10-15 12:45:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:09,836 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 12:45:09,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:09,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:45:09,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:45:09,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:45:09,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:45:09,838 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 63 states. [2018-10-15 12:45:13,129 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-15 12:45:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:14,208 INFO L93 Difference]: Finished difference Result 380 states and 381 transitions. [2018-10-15 12:45:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 12:45:14,208 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 355 [2018-10-15 12:45:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:14,211 INFO L225 Difference]: With dead ends: 380 [2018-10-15 12:45:14,211 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 12:45:14,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9987 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5614, Invalid=25186, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 12:45:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 12:45:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 367. [2018-10-15 12:45:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-15 12:45:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-10-15 12:45:14,217 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 355 [2018-10-15 12:45:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:14,217 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-10-15 12:45:14,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:45:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-10-15 12:45:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-15 12:45:14,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:14,220 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 12:45:14,220 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:14,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:14,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1480741281, now seen corresponding path program 37 times [2018-10-15 12:45:14,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:16,335 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 12:45:16,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:16,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:45:16,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:45:16,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:45:16,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=5921, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:45:16,337 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 83 states. [2018-10-15 12:45:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:21,976 INFO L93 Difference]: Finished difference Result 589 states and 590 transitions. [2018-10-15 12:45:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 12:45:21,976 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 366 [2018-10-15 12:45:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:21,977 INFO L225 Difference]: With dead ends: 589 [2018-10-15 12:45:21,977 INFO L226 Difference]: Without dead ends: 376 [2018-10-15 12:45:21,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8659 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5264, Invalid=27678, Unknown=0, NotChecked=0, Total=32942 [2018-10-15 12:45:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-15 12:45:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2018-10-15 12:45:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:45:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 375 transitions. [2018-10-15 12:45:21,983 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 375 transitions. Word has length 366 [2018-10-15 12:45:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:21,983 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 375 transitions. [2018-10-15 12:45:21,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:45:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 375 transitions. [2018-10-15 12:45:21,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 12:45:21,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:21,985 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 12:45:21,985 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:21,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1832672277, now seen corresponding path program 38 times [2018-10-15 12:45:21,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:23,677 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 12:45:23,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:23,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 12:45:23,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 12:45:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 12:45:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3548, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:45:23,679 INFO L87 Difference]: Start difference. First operand 374 states and 375 transitions. Second operand 66 states. [2018-10-15 12:45:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:27,871 INFO L93 Difference]: Finished difference Result 398 states and 399 transitions. [2018-10-15 12:45:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 12:45:27,872 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 373 [2018-10-15 12:45:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:27,874 INFO L225 Difference]: With dead ends: 398 [2018-10-15 12:45:27,874 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 12:45:27,876 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 12:45:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 12:45:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 385. [2018-10-15 12:45:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-15 12:45:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-10-15 12:45:27,879 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 373 [2018-10-15 12:45:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:27,880 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-10-15 12:45:27,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 12:45:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-10-15 12:45:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-15 12:45:27,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:27,882 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 12:45:27,882 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:27,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash -449809514, now seen corresponding path program 39 times [2018-10-15 12:45:27,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:30,158 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 12:45:30,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:30,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:45:30,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:45:30,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:45:30,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=971, Invalid=6511, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:45:30,160 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 87 states. [2018-10-15 12:45:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:36,452 INFO L93 Difference]: Finished difference Result 618 states and 619 transitions. [2018-10-15 12:45:36,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 12:45:36,452 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 384 [2018-10-15 12:45:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:36,454 INFO L225 Difference]: With dead ends: 618 [2018-10-15 12:45:36,454 INFO L226 Difference]: Without dead ends: 394 [2018-10-15 12:45:36,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9585 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5779, Invalid=30511, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:45:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-15 12:45:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2018-10-15 12:45:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:45:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2018-10-15 12:45:36,459 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 384 [2018-10-15 12:45:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:36,459 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2018-10-15 12:45:36,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:45:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2018-10-15 12:45:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-15 12:45:36,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:36,461 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 12:45:36,462 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:36,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -402552992, now seen corresponding path program 40 times [2018-10-15 12:45:36,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:38,272 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 12:45:38,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:38,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:45:38,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:45:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:45:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3882, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:45:38,274 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 69 states. [2018-10-15 12:45:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:42,460 INFO L93 Difference]: Finished difference Result 416 states and 417 transitions. [2018-10-15 12:45:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:45:42,461 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 391 [2018-10-15 12:45:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:42,464 INFO L225 Difference]: With dead ends: 416 [2018-10-15 12:45:42,464 INFO L226 Difference]: Without dead ends: 416 [2018-10-15 12:45:42,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12215 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6792, Invalid=30650, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 12:45:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-15 12:45:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 403. [2018-10-15 12:45:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 12:45:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-10-15 12:45:42,471 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 391 [2018-10-15 12:45:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:42,471 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-10-15 12:45:42,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:45:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-10-15 12:45:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 12:45:42,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:42,474 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 12:45:42,474 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:42,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash -509131519, now seen corresponding path program 41 times [2018-10-15 12:45:42,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:45,271 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 12:45:45,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:45,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:45:45,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:45:45,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:45:45,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1061, Invalid=7129, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:45:45,273 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 91 states. [2018-10-15 12:45:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:52,027 INFO L93 Difference]: Finished difference Result 647 states and 648 transitions. [2018-10-15 12:45:52,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 12:45:52,027 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 402 [2018-10-15 12:45:52,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:52,029 INFO L225 Difference]: With dead ends: 647 [2018-10-15 12:45:52,029 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 12:45:52,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10558 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=6318, Invalid=33482, Unknown=0, NotChecked=0, Total=39800 [2018-10-15 12:45:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 12:45:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2018-10-15 12:45:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:45:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2018-10-15 12:45:52,035 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 402 [2018-10-15 12:45:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:52,035 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2018-10-15 12:45:52,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:45:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2018-10-15 12:45:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 12:45:52,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:52,038 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 12:45:52,039 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:52,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:52,039 INFO L82 PathProgramCache]: Analyzing trace with hash 535476811, now seen corresponding path program 42 times [2018-10-15 12:45:52,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:53,823 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 12:45:53,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:53,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 12:45:53,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 12:45:53,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 12:45:53,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:45:53,824 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 72 states. [2018-10-15 12:45:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:58,741 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-15 12:45:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 12:45:58,742 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 409 [2018-10-15 12:45:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:58,744 INFO L225 Difference]: With dead ends: 434 [2018-10-15 12:45:58,744 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 12:45:58,746 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 12:45:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 12:45:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 421. [2018-10-15 12:45:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-15 12:45:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-10-15 12:45:58,750 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 409 [2018-10-15 12:45:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:58,750 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-10-15 12:45:58,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 12:45:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-10-15 12:45:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-15 12:45:58,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:58,753 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 12:45:58,753 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:58,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1870814922, now seen corresponding path program 43 times [2018-10-15 12:45:58,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:01,402 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 12:46:01,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:01,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:46:01,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:46:01,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:46:01,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=7775, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:46:01,403 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 95 states. [2018-10-15 12:46:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:08,903 INFO L93 Difference]: Finished difference Result 676 states and 677 transitions. [2018-10-15 12:46:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 12:46:08,903 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 420 [2018-10-15 12:46:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:08,904 INFO L225 Difference]: With dead ends: 676 [2018-10-15 12:46:08,904 INFO L226 Difference]: Without dead ends: 430 [2018-10-15 12:46:08,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11578 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=6881, Invalid=36591, Unknown=0, NotChecked=0, Total=43472 [2018-10-15 12:46:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-15 12:46:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2018-10-15 12:46:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 12:46:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 429 transitions. [2018-10-15 12:46:08,909 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 429 transitions. Word has length 420 [2018-10-15 12:46:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:08,910 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 429 transitions. [2018-10-15 12:46:08,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:46:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 429 transitions. [2018-10-15 12:46:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-15 12:46:08,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:08,911 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 12:46:08,912 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:08,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash 904796160, now seen corresponding path program 44 times [2018-10-15 12:46:08,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:10,808 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 12:46:10,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:10,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:46:10,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:46:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:46:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:46:10,809 INFO L87 Difference]: Start difference. First operand 428 states and 429 transitions. Second operand 75 states. [2018-10-15 12:46:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:16,107 INFO L93 Difference]: Finished difference Result 452 states and 453 transitions. [2018-10-15 12:46:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 12:46:16,108 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 427 [2018-10-15 12:46:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:16,110 INFO L225 Difference]: With dead ends: 452 [2018-10-15 12:46:16,110 INFO L226 Difference]: Without dead ends: 452 [2018-10-15 12:46:16,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8082, Invalid=36650, Unknown=0, NotChecked=0, Total=44732 [2018-10-15 12:46:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-10-15 12:46:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 439. [2018-10-15 12:46:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-15 12:46:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-10-15 12:46:16,116 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 427 [2018-10-15 12:46:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:16,117 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-10-15 12:46:16,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:46:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-10-15 12:46:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-15 12:46:16,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:16,119 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 12:46:16,119 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:16,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1538781087, now seen corresponding path program 45 times [2018-10-15 12:46:16,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:19,109 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 12:46:19,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:19,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:46:19,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:46:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:46:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1253, Invalid=8449, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:46:19,111 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 99 states. [2018-10-15 12:46:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:26,908 INFO L93 Difference]: Finished difference Result 705 states and 706 transitions. [2018-10-15 12:46:26,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 12:46:26,909 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 438 [2018-10-15 12:46:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:26,910 INFO L225 Difference]: With dead ends: 705 [2018-10-15 12:46:26,910 INFO L226 Difference]: Without dead ends: 448 [2018-10-15 12:46:26,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12645 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=7468, Invalid=39838, Unknown=0, NotChecked=0, Total=47306 [2018-10-15 12:46:26,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-15 12:46:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2018-10-15 12:46:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-15 12:46:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 447 transitions. [2018-10-15 12:46:26,916 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 447 transitions. Word has length 438 [2018-10-15 12:46:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:26,916 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 447 transitions. [2018-10-15 12:46:26,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:46:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 447 transitions. [2018-10-15 12:46:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-15 12:46:26,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:26,919 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 12:46:26,919 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:26,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1623709525, now seen corresponding path program 46 times [2018-10-15 12:46:26,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:28,839 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 12:46:28,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:28,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 12:46:28,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 12:46:28,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 12:46:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=4974, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:46:28,841 INFO L87 Difference]: Start difference. First operand 446 states and 447 transitions. Second operand 78 states. [2018-10-15 12:46:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:34,888 INFO L93 Difference]: Finished difference Result 470 states and 471 transitions. [2018-10-15 12:46:34,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:46:34,888 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 445 [2018-10-15 12:46:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:34,891 INFO L225 Difference]: With dead ends: 470 [2018-10-15 12:46:34,891 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 12:46:34,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15977 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8769, Invalid=39851, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 12:46:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 12:46:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 457. [2018-10-15 12:46:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-15 12:46:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 458 transitions. [2018-10-15 12:46:34,898 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 458 transitions. Word has length 445 [2018-10-15 12:46:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:34,898 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 458 transitions. [2018-10-15 12:46:34,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 12:46:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 458 transitions. [2018-10-15 12:46:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-15 12:46:34,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:34,900 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 12:46:34,900 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:34,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:34,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1497532714, now seen corresponding path program 47 times [2018-10-15 12:46:34,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:38,298 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 12:46:38,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:38,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:46:38,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:46:38,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:46:38,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1355, Invalid=9151, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:46:38,300 INFO L87 Difference]: Start difference. First operand 457 states and 458 transitions. Second operand 103 states. [2018-10-15 12:46:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:47,013 INFO L93 Difference]: Finished difference Result 734 states and 735 transitions. [2018-10-15 12:46:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-15 12:46:47,013 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 456 [2018-10-15 12:46:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:47,015 INFO L225 Difference]: With dead ends: 734 [2018-10-15 12:46:47,015 INFO L226 Difference]: Without dead ends: 466 [2018-10-15 12:46:47,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13759 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=8079, Invalid=43223, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:46:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-10-15 12:46:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2018-10-15 12:46:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-15 12:46:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2018-10-15 12:46:47,019 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 456 [2018-10-15 12:46:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:47,020 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2018-10-15 12:46:47,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:46:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2018-10-15 12:46:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-15 12:46:47,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:47,022 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 12:46:47,023 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:47,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:47,023 INFO L82 PathProgramCache]: Analyzing trace with hash 840421536, now seen corresponding path program 48 times [2018-10-15 12:46:47,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:49,109 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 12:46:49,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:49,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:46:49,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:46:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:46:49,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=5368, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:46:49,111 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 81 states. [2018-10-15 12:46:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:55,342 INFO L93 Difference]: Finished difference Result 488 states and 489 transitions. [2018-10-15 12:46:55,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 12:46:55,343 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 463 [2018-10-15 12:46:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:55,346 INFO L225 Difference]: With dead ends: 488 [2018-10-15 12:46:55,346 INFO L226 Difference]: Without dead ends: 488 [2018-10-15 12:46:55,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17343 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9484, Invalid=43186, Unknown=0, NotChecked=0, Total=52670 [2018-10-15 12:46:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-15 12:46:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 475. [2018-10-15 12:46:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-15 12:46:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 476 transitions. [2018-10-15 12:46:55,354 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 476 transitions. Word has length 463 [2018-10-15 12:46:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:55,354 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 476 transitions. [2018-10-15 12:46:55,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:46:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 476 transitions. [2018-10-15 12:46:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-15 12:46:55,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:55,357 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 12:46:55,357 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:55,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:55,358 INFO L82 PathProgramCache]: Analyzing trace with hash 576893889, now seen corresponding path program 49 times [2018-10-15 12:46:55,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:58,724 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 12:46:58,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:58,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:46:58,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:46:58,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:46:58,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1461, Invalid=9881, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:46:58,726 INFO L87 Difference]: Start difference. First operand 475 states and 476 transitions. Second operand 107 states. [2018-10-15 12:47:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:08,079 INFO L93 Difference]: Finished difference Result 763 states and 764 transitions. [2018-10-15 12:47:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 12:47:08,079 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 474 [2018-10-15 12:47:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:08,082 INFO L225 Difference]: With dead ends: 763 [2018-10-15 12:47:08,082 INFO L226 Difference]: Without dead ends: 484 [2018-10-15 12:47:08,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14920 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=8714, Invalid=46746, Unknown=0, NotChecked=0, Total=55460 [2018-10-15 12:47:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-15 12:47:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2018-10-15 12:47:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-15 12:47:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 483 transitions. [2018-10-15 12:47:08,087 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 483 transitions. Word has length 474 [2018-10-15 12:47:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:08,087 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 483 transitions. [2018-10-15 12:47:08,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:47:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 483 transitions. [2018-10-15 12:47:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-15 12:47:08,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:08,090 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 12:47:08,090 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:08,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash -810946805, now seen corresponding path program 50 times [2018-10-15 12:47:08,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:10,460 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 12:47:10,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:10,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 12:47:10,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 12:47:10,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 12:47:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5777, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:47:10,461 INFO L87 Difference]: Start difference. First operand 482 states and 483 transitions. Second operand 84 states. [2018-10-15 12:47:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:16,961 INFO L93 Difference]: Finished difference Result 506 states and 507 transitions. [2018-10-15 12:47:16,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 12:47:16,962 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 481 [2018-10-15 12:47:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:16,965 INFO L225 Difference]: With dead ends: 506 [2018-10-15 12:47:16,965 INFO L226 Difference]: Without dead ends: 506 [2018-10-15 12:47:16,967 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 12:47:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-10-15 12:47:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 493. [2018-10-15 12:47:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-15 12:47:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 494 transitions. [2018-10-15 12:47:16,970 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 494 transitions. Word has length 481 [2018-10-15 12:47:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:16,971 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 494 transitions. [2018-10-15 12:47:16,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 12:47:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 494 transitions. [2018-10-15 12:47:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-15 12:47:16,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:16,973 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 12:47:16,973 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:16,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1104022410, now seen corresponding path program 51 times [2018-10-15 12:47:16,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:20,862 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 12:47:20,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:20,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:47:20,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:47:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:47:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1571, Invalid=10639, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:47:20,864 INFO L87 Difference]: Start difference. First operand 493 states and 494 transitions. Second operand 111 states. [2018-10-15 12:47:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:30,802 INFO L93 Difference]: Finished difference Result 792 states and 793 transitions. [2018-10-15 12:47:30,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-15 12:47:30,802 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 492 [2018-10-15 12:47:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:30,804 INFO L225 Difference]: With dead ends: 792 [2018-10-15 12:47:30,804 INFO L226 Difference]: Without dead ends: 502 [2018-10-15 12:47:30,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16128 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=9373, Invalid=50407, Unknown=0, NotChecked=0, Total=59780 [2018-10-15 12:47:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-10-15 12:47:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2018-10-15 12:47:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 12:47:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 501 transitions. [2018-10-15 12:47:30,809 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 501 transitions. Word has length 492 [2018-10-15 12:47:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:30,809 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 501 transitions. [2018-10-15 12:47:30,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:47:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 501 transitions. [2018-10-15 12:47:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 12:47:30,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:30,811 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 12:47:30,812 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:30,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:30,812 INFO L82 PathProgramCache]: Analyzing trace with hash -8343232, now seen corresponding path program 52 times [2018-10-15 12:47:30,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:32,975 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 12:47:32,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:32,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:47:32,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:47:32,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:47:32,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=6201, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:47:32,977 INFO L87 Difference]: Start difference. First operand 500 states and 501 transitions. Second operand 87 states. [2018-10-15 12:47:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:39,815 INFO L93 Difference]: Finished difference Result 524 states and 525 transitions. [2018-10-15 12:47:39,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 12:47:39,815 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 499 [2018-10-15 12:47:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:39,818 INFO L225 Difference]: With dead ends: 524 [2018-10-15 12:47:39,818 INFO L226 Difference]: Without dead ends: 524 [2018-10-15 12:47:39,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20243 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10998, Invalid=50258, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 12:47:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-15 12:47:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 511. [2018-10-15 12:47:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-15 12:47:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-10-15 12:47:39,825 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 499 [2018-10-15 12:47:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:39,825 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-10-15 12:47:39,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:47:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-10-15 12:47:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-15 12:47:39,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:39,828 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 12:47:39,828 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:39,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1548407007, now seen corresponding path program 53 times [2018-10-15 12:47:39,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:43,869 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 12:47:43,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:43,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:47:43,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:47:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:47:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=11425, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:47:43,871 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 115 states. [2018-10-15 12:47:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:54,468 INFO L93 Difference]: Finished difference Result 821 states and 822 transitions. [2018-10-15 12:47:54,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-15 12:47:54,468 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 510 [2018-10-15 12:47:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:54,470 INFO L225 Difference]: With dead ends: 821 [2018-10-15 12:47:54,470 INFO L226 Difference]: Without dead ends: 520 [2018-10-15 12:47:54,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17383 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=10056, Invalid=54206, Unknown=0, NotChecked=0, Total=64262 [2018-10-15 12:47:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-15 12:47:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2018-10-15 12:47:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-15 12:47:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 519 transitions. [2018-10-15 12:47:54,475 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 519 transitions. Word has length 510 [2018-10-15 12:47:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:54,475 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 519 transitions. [2018-10-15 12:47:54,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:47:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 519 transitions. [2018-10-15 12:47:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-10-15 12:47:54,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:54,477 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 12:47:54,478 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:54,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:54,478 INFO L82 PathProgramCache]: Analyzing trace with hash -708965013, now seen corresponding path program 54 times [2018-10-15 12:47:54,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:57,158 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 12:47:57,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:57,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 12:47:57,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 12:47:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 12:47:57,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=6640, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:47:57,160 INFO L87 Difference]: Start difference. First operand 518 states and 519 transitions. Second operand 90 states. [2018-10-15 12:48:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:04,536 INFO L93 Difference]: Finished difference Result 542 states and 543 transitions. [2018-10-15 12:48:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 12:48:04,536 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 517 [2018-10-15 12:48:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:04,539 INFO L225 Difference]: With dead ends: 542 [2018-10-15 12:48:04,539 INFO L226 Difference]: Without dead ends: 542 [2018-10-15 12:48:04,541 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 12:48:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-15 12:48:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 529. [2018-10-15 12:48:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-15 12:48:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 530 transitions. [2018-10-15 12:48:04,545 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 530 transitions. Word has length 517 [2018-10-15 12:48:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:04,546 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 530 transitions. [2018-10-15 12:48:04,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 12:48:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 530 transitions. [2018-10-15 12:48:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-15 12:48:04,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:04,548 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 12:48:04,548 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:04,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1751311850, now seen corresponding path program 55 times [2018-10-15 12:48:04,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:08,905 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 12:48:08,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:08,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:48:08,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:48:08,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:48:08,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1803, Invalid=12239, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:48:08,907 INFO L87 Difference]: Start difference. First operand 529 states and 530 transitions. Second operand 119 states. [2018-10-15 12:48:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:16,980 INFO L93 Difference]: Finished difference Result 850 states and 851 transitions. [2018-10-15 12:48:16,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-15 12:48:16,980 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 528 [2018-10-15 12:48:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:16,982 INFO L225 Difference]: With dead ends: 850 [2018-10-15 12:48:16,982 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 12:48:16,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18685 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=10763, Invalid=58143, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:48:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 12:48:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2018-10-15 12:48:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-15 12:48:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2018-10-15 12:48:16,988 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 528 [2018-10-15 12:48:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:16,989 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2018-10-15 12:48:16,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:48:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2018-10-15 12:48:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-10-15 12:48:16,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:16,991 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 12:48:16,991 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:16,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:16,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1951745568, now seen corresponding path program 56 times [2018-10-15 12:48:16,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:19,461 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 12:48:19,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:19,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:48:19,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:48:19,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:48:19,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1462, Invalid=7094, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:48:19,463 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 93 states. [2018-10-15 12:48:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:27,578 INFO L93 Difference]: Finished difference Result 560 states and 561 transitions. [2018-10-15 12:48:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 12:48:27,579 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 535 [2018-10-15 12:48:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:27,582 INFO L225 Difference]: With dead ends: 560 [2018-10-15 12:48:27,582 INFO L226 Difference]: Without dead ends: 560 [2018-10-15 12:48:27,586 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 12:48:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-15 12:48:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 547. [2018-10-15 12:48:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-15 12:48:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 548 transitions. [2018-10-15 12:48:27,590 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 548 transitions. Word has length 535 [2018-10-15 12:48:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:27,591 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 548 transitions. [2018-10-15 12:48:27,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:48:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 548 transitions. [2018-10-15 12:48:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-10-15 12:48:27,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:27,593 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 12:48:27,593 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:27,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash 360546945, now seen corresponding path program 57 times [2018-10-15 12:48:27,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:32,012 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 12:48:32,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:32,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:48:32,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:48:32,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:48:32,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1925, Invalid=13081, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:48:32,014 INFO L87 Difference]: Start difference. First operand 547 states and 548 transitions. Second operand 123 states. [2018-10-15 12:48:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:41,401 INFO L93 Difference]: Finished difference Result 879 states and 880 transitions. [2018-10-15 12:48:41,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-15 12:48:41,401 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 546 [2018-10-15 12:48:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:41,403 INFO L225 Difference]: With dead ends: 879 [2018-10-15 12:48:41,403 INFO L226 Difference]: Without dead ends: 556 [2018-10-15 12:48:41,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20034 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=11494, Invalid=62218, Unknown=0, NotChecked=0, Total=73712 [2018-10-15 12:48:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-10-15 12:48:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2018-10-15 12:48:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-15 12:48:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2018-10-15 12:48:41,411 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 546 [2018-10-15 12:48:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:41,411 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2018-10-15 12:48:41,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:48:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2018-10-15 12:48:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-10-15 12:48:41,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:41,415 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 12:48:41,415 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:41,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash 460489675, now seen corresponding path program 58 times [2018-10-15 12:48:41,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:44,250 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 12:48:44,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:44,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 12:48:44,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 12:48:44,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 12:48:44,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=7563, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:48:44,252 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 96 states. [2018-10-15 12:48:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:52,714 INFO L93 Difference]: Finished difference Result 578 states and 579 transitions. [2018-10-15 12:48:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 12:48:52,714 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 553 [2018-10-15 12:48:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:52,717 INFO L225 Difference]: With dead ends: 578 [2018-10-15 12:48:52,717 INFO L226 Difference]: Without dead ends: 578 [2018-10-15 12:48:52,721 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 12:48:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-15 12:48:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 565. [2018-10-15 12:48:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-15 12:48:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 566 transitions. [2018-10-15 12:48:52,726 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 566 transitions. Word has length 553 [2018-10-15 12:48:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:52,726 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 566 transitions. [2018-10-15 12:48:52,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 12:48:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 566 transitions. [2018-10-15 12:48:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-10-15 12:48:52,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:52,729 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 12:48:52,729 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:52,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:52,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1044441014, now seen corresponding path program 59 times [2018-10-15 12:48:52,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:57,362 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 12:48:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:57,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 12:48:57,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 12:48:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 12:48:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2051, Invalid=13951, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:48:57,364 INFO L87 Difference]: Start difference. First operand 565 states and 566 transitions. Second operand 127 states. [2018-10-15 12:49:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:10,452 INFO L93 Difference]: Finished difference Result 908 states and 909 transitions. [2018-10-15 12:49:10,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 12:49:10,453 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 564 [2018-10-15 12:49:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:10,454 INFO L225 Difference]: With dead ends: 908 [2018-10-15 12:49:10,455 INFO L226 Difference]: Without dead ends: 574 [2018-10-15 12:49:10,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21430 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=12249, Invalid=66431, Unknown=0, NotChecked=0, Total=78680 [2018-10-15 12:49:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-10-15 12:49:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2018-10-15 12:49:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-15 12:49:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 573 transitions. [2018-10-15 12:49:10,461 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 573 transitions. Word has length 564 [2018-10-15 12:49:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:10,461 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 573 transitions. [2018-10-15 12:49:10,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 12:49:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 573 transitions. [2018-10-15 12:49:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-15 12:49:10,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:10,464 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 12:49:10,464 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:10,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1365775744, now seen corresponding path program 60 times [2018-10-15 12:49:10,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:13,563 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 12:49:13,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:13,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:49:13,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:49:13,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:49:13,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=8047, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:49:13,565 INFO L87 Difference]: Start difference. First operand 572 states and 573 transitions. Second operand 99 states. [2018-10-15 12:49:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:22,403 INFO L93 Difference]: Finished difference Result 596 states and 597 transitions. [2018-10-15 12:49:22,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 12:49:22,403 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 571 [2018-10-15 12:49:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:22,406 INFO L225 Difference]: With dead ends: 596 [2018-10-15 12:49:22,406 INFO L226 Difference]: Without dead ends: 596 [2018-10-15 12:49:22,409 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 12:49:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-10-15 12:49:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 583. [2018-10-15 12:49:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-10-15 12:49:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-10-15 12:49:22,414 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 571 [2018-10-15 12:49:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:22,414 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-10-15 12:49:22,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:49:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-10-15 12:49:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-10-15 12:49:22,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:22,417 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 12:49:22,417 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:22,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash -361124383, now seen corresponding path program 61 times [2018-10-15 12:49:22,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:27,383 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 12:49:27,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:27,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 12:49:27,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 12:49:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 12:49:27,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2181, Invalid=14849, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:49:27,385 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 131 states. [2018-10-15 12:49:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:41,106 INFO L93 Difference]: Finished difference Result 937 states and 938 transitions. [2018-10-15 12:49:41,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-15 12:49:41,107 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 582 [2018-10-15 12:49:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:41,108 INFO L225 Difference]: With dead ends: 937 [2018-10-15 12:49:41,109 INFO L226 Difference]: Without dead ends: 592 [2018-10-15 12:49:41,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22873 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=13028, Invalid=70782, Unknown=0, NotChecked=0, Total=83810 [2018-10-15 12:49:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-10-15 12:49:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2018-10-15 12:49:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-15 12:49:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 591 transitions. [2018-10-15 12:49:41,115 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 591 transitions. Word has length 582 [2018-10-15 12:49:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:41,115 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 591 transitions. [2018-10-15 12:49:41,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 12:49:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 591 transitions. [2018-10-15 12:49:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 12:49:41,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:41,118 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 12:49:41,118 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:41,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash 809849387, now seen corresponding path program 62 times [2018-10-15 12:49:41,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:44,408 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 12:49:44,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:44,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 12:49:44,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 12:49:44,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 12:49:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1756, Invalid=8546, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:49:44,410 INFO L87 Difference]: Start difference. First operand 590 states and 591 transitions. Second operand 102 states. [2018-10-15 12:49:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:53,794 INFO L93 Difference]: Finished difference Result 614 states and 615 transitions. [2018-10-15 12:49:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-10-15 12:49:53,794 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 589 [2018-10-15 12:49:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:53,797 INFO L225 Difference]: With dead ends: 614 [2018-10-15 12:49:53,797 INFO L226 Difference]: Without dead ends: 614 [2018-10-15 12:49:53,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28473 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=15273, Invalid=70283, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 12:49:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-15 12:49:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 601. [2018-10-15 12:49:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-10-15 12:49:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 602 transitions. [2018-10-15 12:49:53,804 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 602 transitions. Word has length 589 [2018-10-15 12:49:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:53,805 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 602 transitions. [2018-10-15 12:49:53,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 12:49:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 602 transitions. [2018-10-15 12:49:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-10-15 12:49:53,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:53,808 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 12:49:53,808 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:53,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash 668949846, now seen corresponding path program 63 times [2018-10-15 12:49:53,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:59,048 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 12:49:59,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:59,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 12:49:59,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 12:49:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 12:49:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2315, Invalid=15775, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:49:59,050 INFO L87 Difference]: Start difference. First operand 601 states and 602 transitions. Second operand 135 states. [2018-10-15 12:50:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:13,871 INFO L93 Difference]: Finished difference Result 966 states and 967 transitions. [2018-10-15 12:50:13,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 12:50:13,871 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 600 [2018-10-15 12:50:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:13,873 INFO L225 Difference]: With dead ends: 966 [2018-10-15 12:50:13,873 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 12:50:13,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24363 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=13831, Invalid=75271, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 12:50:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 12:50:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2018-10-15 12:50:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-15 12:50:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2018-10-15 12:50:13,879 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 600 [2018-10-15 12:50:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:13,880 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2018-10-15 12:50:13,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 12:50:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2018-10-15 12:50:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-10-15 12:50:13,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:13,883 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 12:50:13,883 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:13,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1254769440, now seen corresponding path program 64 times [2018-10-15 12:50:13,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:17,280 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 12:50:17,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:17,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:50:17,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:50:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:50:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9060, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:50:17,282 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 105 states. [2018-10-15 12:50:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:27,146 INFO L93 Difference]: Finished difference Result 632 states and 633 transitions. [2018-10-15 12:50:27,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-15 12:50:27,147 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 607 [2018-10-15 12:50:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:27,150 INFO L225 Difference]: With dead ends: 632 [2018-10-15 12:50:27,150 INFO L226 Difference]: Without dead ends: 632 [2018-10-15 12:50:27,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30287 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=16212, Invalid=74690, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 12:50:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-15 12:50:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 619. [2018-10-15 12:50:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-15 12:50:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 620 transitions. [2018-10-15 12:50:27,158 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 620 transitions. Word has length 607 [2018-10-15 12:50:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:27,158 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 620 transitions. [2018-10-15 12:50:27,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:50:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 620 transitions. [2018-10-15 12:50:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-15 12:50:27,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:27,161 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 12:50:27,161 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:27,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash -85479103, now seen corresponding path program 65 times [2018-10-15 12:50:27,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:32,933 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 12:50:32,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:32,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 12:50:32,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 12:50:32,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 12:50:32,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2453, Invalid=16729, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:50:32,935 INFO L87 Difference]: Start difference. First operand 619 states and 620 transitions. Second operand 139 states. [2018-10-15 12:50:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:48,475 INFO L93 Difference]: Finished difference Result 995 states and 996 transitions. [2018-10-15 12:50:48,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-10-15 12:50:48,475 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 618 [2018-10-15 12:50:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:48,477 INFO L225 Difference]: With dead ends: 995 [2018-10-15 12:50:48,477 INFO L226 Difference]: Without dead ends: 628 [2018-10-15 12:50:48,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25900 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=14658, Invalid=79898, Unknown=0, NotChecked=0, Total=94556 [2018-10-15 12:50:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-15 12:50:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2018-10-15 12:50:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-15 12:50:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 627 transitions. [2018-10-15 12:50:48,482 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 627 transitions. Word has length 618 [2018-10-15 12:50:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:48,483 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 627 transitions. [2018-10-15 12:50:48,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 12:50:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 627 transitions. [2018-10-15 12:50:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-10-15 12:50:48,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:48,485 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 12:50:48,486 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:48,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1456179061, now seen corresponding path program 66 times [2018-10-15 12:50:48,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:52,740 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 12:50:52,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:52,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 12:50:52,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 12:50:52,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 12:50:52,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1967, Invalid=9589, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:50:52,742 INFO L87 Difference]: Start difference. First operand 626 states and 627 transitions. Second operand 108 states. [2018-10-15 12:51:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:02,685 INFO L93 Difference]: Finished difference Result 650 states and 651 transitions. [2018-10-15 12:51:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-15 12:51:02,686 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 625 [2018-10-15 12:51:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:02,689 INFO L225 Difference]: With dead ends: 650 [2018-10-15 12:51:02,689 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 12:51:02,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32157 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17179, Invalid=79231, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 12:51:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 12:51:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 637. [2018-10-15 12:51:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-10-15 12:51:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 638 transitions. [2018-10-15 12:51:02,695 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 638 transitions. Word has length 625 [2018-10-15 12:51:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:02,696 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 638 transitions. [2018-10-15 12:51:02,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 12:51:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 638 transitions. [2018-10-15 12:51:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-10-15 12:51:02,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:02,699 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 12:51:02,699 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:02,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1421507318, now seen corresponding path program 67 times [2018-10-15 12:51:02,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:08,683 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 12:51:08,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:08,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 12:51:08,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 12:51:08,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 12:51:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2595, Invalid=17711, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:51:08,685 INFO L87 Difference]: Start difference. First operand 637 states and 638 transitions. Second operand 143 states. [2018-10-15 12:51:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:25,339 INFO L93 Difference]: Finished difference Result 1024 states and 1025 transitions. [2018-10-15 12:51:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-15 12:51:25,339 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 636 [2018-10-15 12:51:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:25,342 INFO L225 Difference]: With dead ends: 1024 [2018-10-15 12:51:25,342 INFO L226 Difference]: Without dead ends: 646 [2018-10-15 12:51:25,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27484 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=15509, Invalid=84663, Unknown=0, NotChecked=0, Total=100172 [2018-10-15 12:51:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-10-15 12:51:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2018-10-15 12:51:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-10-15 12:51:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 645 transitions. [2018-10-15 12:51:25,349 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 645 transitions. Word has length 636 [2018-10-15 12:51:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:25,349 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 645 transitions. [2018-10-15 12:51:25,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 12:51:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 645 transitions. [2018-10-15 12:51:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-10-15 12:51:25,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:25,352 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 12:51:25,352 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:25,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:25,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1833157568, now seen corresponding path program 68 times [2018-10-15 12:51:25,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:29,105 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 12:51:29,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:29,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:51:29,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:51:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:51:29,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=10133, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:51:29,107 INFO L87 Difference]: Start difference. First operand 644 states and 645 transitions. Second operand 111 states. [2018-10-15 12:51:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:39,404 INFO L93 Difference]: Finished difference Result 668 states and 669 transitions. [2018-10-15 12:51:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-10-15 12:51:39,404 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 643 [2018-10-15 12:51:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:39,408 INFO L225 Difference]: With dead ends: 668 [2018-10-15 12:51:39,408 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 12:51:39,411 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 12:51:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 12:51:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 655. [2018-10-15 12:51:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-10-15 12:51:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2018-10-15 12:51:39,416 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 643 [2018-10-15 12:51:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:39,417 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2018-10-15 12:51:39,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:51:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2018-10-15 12:51:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-10-15 12:51:39,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:39,420 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 12:51:39,420 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:39,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:39,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1686473889, now seen corresponding path program 69 times [2018-10-15 12:51:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 6720 proven. 4200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:45,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:45,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 12:51:45,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 12:51:45,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 12:51:45,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2741, Invalid=18721, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:51:45,673 INFO L87 Difference]: Start difference. First operand 655 states and 656 transitions. Second operand 147 states.