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/array_true-unreach-call4_true-termination.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:26:23,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:26:23,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:26:23,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:26:23,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:26:23,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:26:23,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:26:23,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:26:23,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:26:23,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:26:23,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:26:23,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:26:23,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:26:23,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:26:23,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:26:23,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:26:23,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:26:23,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:26:23,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:26:23,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:26:23,969 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:26:23,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:26:23,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:26:23,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:26:23,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:26:23,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:26:23,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:26:23,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:26:23,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:26:23,982 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:26:23,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:26:23,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:26:23,985 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:26:23,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:26:23,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:26:23,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:26:23,988 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:26:24,002 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:26:24,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:26:24,004 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:26:24,004 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:26:24,004 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:26:24,004 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:26:24,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:26:24,005 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:26:24,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:26:24,006 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:26:24,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:26:24,006 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:26:24,006 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:26:24,007 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:26:24,007 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:26:24,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:26:24,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:26:24,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:26:24,071 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:26:24,071 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:26:24,072 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call4_true-termination.i_5.bpl [2018-10-15 12:26:24,073 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call4_true-termination.i_5.bpl' [2018-10-15 12:26:24,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:26:24,155 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:26:24,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:26:24,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:26:24,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:26:24,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:26:24,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:26:24,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:26:24,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:26:24,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (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:26:24,278 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:26:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:26:24,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:26:24,717 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:26:24,717 INFO L202 PluginConnector]: Adding new model array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:24 BoogieIcfgContainer [2018-10-15 12:26:24,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:26:24,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:26:24,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:26:24,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:26:24,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/2) ... [2018-10-15 12:26:24,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2d5944 and model type array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:26:24, skipping insertion in model container [2018-10-15 12:26:24,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call4_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:24" (2/2) ... [2018-10-15 12:26:24,727 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call4_true-termination.i_5.bpl [2018-10-15 12:26:24,738 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:26:24,747 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:26:24,766 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:26:24,798 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:26:24,798 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:26:24,799 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:26:24,799 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:26:24,799 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:26:24,799 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:26:24,799 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:26:24,800 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:26:24,800 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:26:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-10-15 12:26:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:26:24,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:24,829 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] [2018-10-15 12:26:24,831 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:24,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash -50841309, now seen corresponding path program 1 times [2018-10-15 12:26:24,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,066 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:26:25,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:26:25,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:26:25,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:26:25,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:26:25,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:26:25,091 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-10-15 12:26:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:25,197 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-10-15 12:26:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:26:25,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-15 12:26:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:25,211 INFO L225 Difference]: With dead ends: 62 [2018-10-15 12:26:25,211 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 12:26:25,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:26:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 12:26:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2018-10-15 12:26:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 12:26:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-10-15 12:26:25,254 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 30 [2018-10-15 12:26:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:25,255 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-10-15 12:26:25,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:26:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-10-15 12:26:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:26:25,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:25,257 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:25,257 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:25,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash 116672684, now seen corresponding path program 1 times [2018-10-15 12:26:25,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:25,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:25,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:26:25,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:26:25,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:26:25,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:26:25,422 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 5 states. [2018-10-15 12:26:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:25,807 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-10-15 12:26:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:26:25,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-15 12:26:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:25,814 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:26:25,814 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 12:26:25,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:26:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 12:26:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2018-10-15 12:26:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 12:26:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-15 12:26:25,826 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 37 [2018-10-15 12:26:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:25,826 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-15 12:26:25,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:26:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-15 12:26:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 12:26:25,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:25,828 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:25,829 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:25,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash -761635581, now seen corresponding path program 2 times [2018-10-15 12:26:25,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:25,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:25,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:26:25,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:26:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:26:25,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:26:25,998 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 7 states. [2018-10-15 12:26:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:26,321 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-10-15 12:26:26,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:26:26,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-15 12:26:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:26,323 INFO L225 Difference]: With dead ends: 76 [2018-10-15 12:26:26,323 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 12:26:26,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:26:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 12:26:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2018-10-15 12:26:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:26:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-10-15 12:26:26,332 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 44 [2018-10-15 12:26:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:26,333 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-10-15 12:26:26,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:26:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-10-15 12:26:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-15 12:26:26,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:26,335 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:26,335 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:26,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1522792244, now seen corresponding path program 3 times [2018-10-15 12:26:26,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:26,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:26,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:26:26,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:26:26,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:26:26,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:26:26,487 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 9 states. [2018-10-15 12:26:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:27,023 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-10-15 12:26:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:26:27,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-10-15 12:26:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:27,027 INFO L225 Difference]: With dead ends: 83 [2018-10-15 12:26:27,027 INFO L226 Difference]: Without dead ends: 83 [2018-10-15 12:26:27,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-15 12:26:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-10-15 12:26:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 12:26:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-15 12:26:27,036 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 51 [2018-10-15 12:26:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:27,036 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-15 12:26:27,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:26:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-15 12:26:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:26:27,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:27,038 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:27,039 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:27,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:27,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1002424093, now seen corresponding path program 4 times [2018-10-15 12:26:27,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:27,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:27,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:26:27,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:26:27,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:26:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:26:27,274 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 11 states. [2018-10-15 12:26:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:27,917 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-10-15 12:26:27,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:26:27,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-15 12:26:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:27,919 INFO L225 Difference]: With dead ends: 90 [2018-10-15 12:26:27,920 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:26:27,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:26:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-10-15 12:26:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 12:26:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-10-15 12:26:27,928 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 58 [2018-10-15 12:26:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:27,928 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-10-15 12:26:27,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:26:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-10-15 12:26:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 12:26:27,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:27,930 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:27,931 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:27,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:27,931 INFO L82 PathProgramCache]: Analyzing trace with hash 107024620, now seen corresponding path program 5 times [2018-10-15 12:26:27,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:28,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:28,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:26:28,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:26:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:26:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:26:28,370 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 13 states. [2018-10-15 12:26:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:28,706 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-10-15 12:26:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:26:28,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-10-15 12:26:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:28,710 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:26:28,710 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:26:28,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:26:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:26:28,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-10-15 12:26:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 12:26:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-10-15 12:26:28,725 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 65 [2018-10-15 12:26:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:28,727 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-10-15 12:26:28,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:26:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-10-15 12:26:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:26:28,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:28,729 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:28,730 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:28,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash -989344573, now seen corresponding path program 6 times [2018-10-15 12:26:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:28,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:28,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:26:28,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:26:28,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:26:28,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:28,977 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 15 states. [2018-10-15 12:26:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:29,324 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-10-15 12:26:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:26:29,324 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-10-15 12:26:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:29,326 INFO L225 Difference]: With dead ends: 104 [2018-10-15 12:26:29,327 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 12:26:29,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 12:26:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-10-15 12:26:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 12:26:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-10-15 12:26:29,336 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 72 [2018-10-15 12:26:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:29,336 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-10-15 12:26:29,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:26:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-10-15 12:26:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:26:29,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:29,338 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:29,338 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:29,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash 428171532, now seen corresponding path program 7 times [2018-10-15 12:26:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:29,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:29,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:26:29,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:26:29,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:26:29,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:26:29,598 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2018-10-15 12:26:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:30,276 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-10-15 12:26:30,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:26:30,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2018-10-15 12:26:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:30,278 INFO L225 Difference]: With dead ends: 111 [2018-10-15 12:26:30,278 INFO L226 Difference]: Without dead ends: 111 [2018-10-15 12:26:30,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-15 12:26:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2018-10-15 12:26:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:26:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-15 12:26:30,286 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 79 [2018-10-15 12:26:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:30,286 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-15 12:26:30,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:26:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-15 12:26:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 12:26:30,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:30,289 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:30,289 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:30,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash -74508125, now seen corresponding path program 8 times [2018-10-15 12:26:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:30,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:30,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:26:30,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:26:30,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:26:30,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:30,805 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 19 states. [2018-10-15 12:26:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:31,542 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2018-10-15 12:26:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:26:31,543 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-10-15 12:26:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:31,544 INFO L225 Difference]: With dead ends: 118 [2018-10-15 12:26:31,545 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 12:26:31,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 12:26:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2018-10-15 12:26:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 12:26:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-10-15 12:26:31,553 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 86 [2018-10-15 12:26:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:31,554 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-10-15 12:26:31,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:26:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-10-15 12:26:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-15 12:26:31,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:31,556 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:31,558 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:31,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1437927124, now seen corresponding path program 9 times [2018-10-15 12:26:31,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:31,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:31,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:26:31,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:26:31,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:26:31,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:26:31,895 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 21 states. [2018-10-15 12:26:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:32,328 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-10-15 12:26:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:26:32,328 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-10-15 12:26:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:32,329 INFO L225 Difference]: With dead ends: 125 [2018-10-15 12:26:32,330 INFO L226 Difference]: Without dead ends: 125 [2018-10-15 12:26:32,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-15 12:26:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2018-10-15 12:26:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 12:26:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-10-15 12:26:32,336 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 93 [2018-10-15 12:26:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:32,337 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-10-15 12:26:32,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:26:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-10-15 12:26:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:26:32,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:32,339 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:32,339 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:32,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:32,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1577837437, now seen corresponding path program 10 times [2018-10-15 12:26:32,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:32,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:32,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:26:32,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:26:32,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:26:32,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:26:32,875 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 23 states. [2018-10-15 12:26:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:33,694 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-10-15 12:26:33,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:26:33,694 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-10-15 12:26:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:33,695 INFO L225 Difference]: With dead ends: 132 [2018-10-15 12:26:33,695 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 12:26:33,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 12:26:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-10-15 12:26:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-15 12:26:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-10-15 12:26:33,703 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 100 [2018-10-15 12:26:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:33,704 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-10-15 12:26:33,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:26:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-10-15 12:26:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 12:26:33,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:33,706 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:33,706 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:33,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2133599924, now seen corresponding path program 11 times [2018-10-15 12:26:33,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:34,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:34,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:26:34,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:26:34,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:26:34,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:26:34,160 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 25 states. [2018-10-15 12:26:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:34,671 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-10-15 12:26:34,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:26:34,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 107 [2018-10-15 12:26:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:34,673 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:26:34,673 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 12:26:34,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 12:26:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2018-10-15 12:26:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:26:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-10-15 12:26:34,679 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 107 [2018-10-15 12:26:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:34,680 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-10-15 12:26:34,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:26:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-10-15 12:26:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:26:34,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:34,681 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:34,682 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:34,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash -439035805, now seen corresponding path program 12 times [2018-10-15 12:26:34,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:35,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:35,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:26:35,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:26:35,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:26:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:35,093 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 27 states. [2018-10-15 12:26:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:35,711 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2018-10-15 12:26:35,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:26:35,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 114 [2018-10-15 12:26:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:35,713 INFO L225 Difference]: With dead ends: 146 [2018-10-15 12:26:35,714 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 12:26:35,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:26:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 12:26:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2018-10-15 12:26:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 12:26:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-10-15 12:26:35,721 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 114 [2018-10-15 12:26:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:35,724 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-10-15 12:26:35,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:26:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-10-15 12:26:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 12:26:35,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:35,726 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:35,726 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:35,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2117992084, now seen corresponding path program 13 times [2018-10-15 12:26:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:36,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:36,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:26:36,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:26:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:26:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:26:36,740 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 29 states. [2018-10-15 12:26:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:38,025 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-10-15 12:26:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:26:38,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-10-15 12:26:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:38,028 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:26:38,028 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:26:38,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:26:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:26:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2018-10-15 12:26:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 12:26:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-10-15 12:26:38,033 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 121 [2018-10-15 12:26:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:38,033 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-10-15 12:26:38,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:26:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-10-15 12:26:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 12:26:38,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:38,034 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:38,034 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:38,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash -934327229, now seen corresponding path program 14 times [2018-10-15 12:26:38,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:39,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:39,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:26:39,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:26:39,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:26:39,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:39,254 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 31 states. [2018-10-15 12:26:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:39,875 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2018-10-15 12:26:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:26:39,876 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-10-15 12:26:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:39,877 INFO L225 Difference]: With dead ends: 160 [2018-10-15 12:26:39,878 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 12:26:39,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:26:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 12:26:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-10-15 12:26:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:26:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-10-15 12:26:39,883 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 128 [2018-10-15 12:26:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:39,883 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-10-15 12:26:39,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:26:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-10-15 12:26:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 12:26:39,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:39,884 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:39,884 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:39,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:39,885 INFO L82 PathProgramCache]: Analyzing trace with hash -835227252, now seen corresponding path program 15 times [2018-10-15 12:26:39,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:40,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:40,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:26:40,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:26:40,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:26:40,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:26:40,818 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 33 states. [2018-10-15 12:26:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:41,698 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-10-15 12:26:41,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:26:41,700 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 135 [2018-10-15 12:26:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:41,701 INFO L225 Difference]: With dead ends: 167 [2018-10-15 12:26:41,702 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 12:26:41,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:26:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 12:26:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2018-10-15 12:26:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 12:26:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-10-15 12:26:41,707 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 135 [2018-10-15 12:26:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:41,707 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-10-15 12:26:41,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:26:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-10-15 12:26:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:26:41,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:41,708 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:41,709 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:41,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:41,709 INFO L82 PathProgramCache]: Analyzing trace with hash -33458141, now seen corresponding path program 16 times [2018-10-15 12:26:41,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:42,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:42,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:26:42,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:26:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:26:42,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:42,390 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 35 states. [2018-10-15 12:26:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:43,290 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-10-15 12:26:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:26:43,291 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-10-15 12:26:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:43,292 INFO L225 Difference]: With dead ends: 174 [2018-10-15 12:26:43,292 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 12:26:43,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:26:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 12:26:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2018-10-15 12:26:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-15 12:26:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-10-15 12:26:43,299 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 142 [2018-10-15 12:26:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:43,300 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-10-15 12:26:43,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:26:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-10-15 12:26:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:26:43,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:43,301 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:43,301 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:43,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash -472503892, now seen corresponding path program 17 times [2018-10-15 12:26:43,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 0 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:43,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:43,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:26:43,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:26:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:26:43,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:26:43,881 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 37 states. [2018-10-15 12:26:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:44,782 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-10-15 12:26:44,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:26:44,783 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 149 [2018-10-15 12:26:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:44,784 INFO L225 Difference]: With dead ends: 181 [2018-10-15 12:26:44,785 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 12:26:44,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:26:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 12:26:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2018-10-15 12:26:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:26:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-10-15 12:26:44,789 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 149 [2018-10-15 12:26:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:44,790 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-10-15 12:26:44,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:26:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-10-15 12:26:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 12:26:44,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:44,791 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:44,791 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:44,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -821470205, now seen corresponding path program 18 times [2018-10-15 12:26:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:45,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:26:45,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:26:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:26:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:45,310 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 39 states. [2018-10-15 12:26:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:46,463 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-15 12:26:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:26:46,463 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 156 [2018-10-15 12:26:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:46,464 INFO L225 Difference]: With dead ends: 188 [2018-10-15 12:26:46,464 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 12:26:46,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:26:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 12:26:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2018-10-15 12:26:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 12:26:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-10-15 12:26:46,469 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 156 [2018-10-15 12:26:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:46,469 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-10-15 12:26:46,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:26:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-10-15 12:26:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:26:46,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:46,471 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:46,471 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:46,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:46,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1128257076, now seen corresponding path program 19 times [2018-10-15 12:26:46,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:47,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:47,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:26:47,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:26:47,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:26:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:26:47,421 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 41 states. [2018-10-15 12:26:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:48,536 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-10-15 12:26:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:26:48,536 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-10-15 12:26:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:48,538 INFO L225 Difference]: With dead ends: 195 [2018-10-15 12:26:48,538 INFO L226 Difference]: Without dead ends: 195 [2018-10-15 12:26:48,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:26:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-15 12:26:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 175. [2018-10-15 12:26:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 12:26:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-15 12:26:48,545 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 163 [2018-10-15 12:26:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:48,545 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-15 12:26:48,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:26:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-15 12:26:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:26:48,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:48,546 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:48,546 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:48,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:48,547 INFO L82 PathProgramCache]: Analyzing trace with hash -150669341, now seen corresponding path program 20 times [2018-10-15 12:26:48,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:49,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:49,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:26:49,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:26:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:26:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:49,188 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 43 states. [2018-10-15 12:26:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:50,246 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-10-15 12:26:50,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:26:50,246 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-10-15 12:26:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:50,248 INFO L225 Difference]: With dead ends: 202 [2018-10-15 12:26:50,248 INFO L226 Difference]: Without dead ends: 202 [2018-10-15 12:26:50,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:26:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-15 12:26:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2018-10-15 12:26:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:26:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-10-15 12:26:50,254 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 170 [2018-10-15 12:26:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:50,254 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-10-15 12:26:50,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:26:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-10-15 12:26:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-15 12:26:50,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:50,256 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:50,256 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:50,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash -275287572, now seen corresponding path program 21 times [2018-10-15 12:26:50,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 0 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:51,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:51,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:26:51,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:26:51,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:26:51,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:26:51,682 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 45 states. [2018-10-15 12:26:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:52,899 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-10-15 12:26:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:26:52,906 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 177 [2018-10-15 12:26:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:52,907 INFO L225 Difference]: With dead ends: 209 [2018-10-15 12:26:52,907 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 12:26:52,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:26:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 12:26:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2018-10-15 12:26:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-15 12:26:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-10-15 12:26:52,912 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 177 [2018-10-15 12:26:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:52,912 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-10-15 12:26:52,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:26:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-10-15 12:26:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:26:52,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:52,914 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:52,914 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:52,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2062398525, now seen corresponding path program 22 times [2018-10-15 12:26:52,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:53,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:53,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:26:53,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:26:53,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:26:53,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:53,638 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 47 states. [2018-10-15 12:26:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:56,156 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-10-15 12:26:56,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:26:56,157 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 184 [2018-10-15 12:26:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:56,158 INFO L225 Difference]: With dead ends: 216 [2018-10-15 12:26:56,159 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 12:26:56,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:26:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 12:26:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 196. [2018-10-15 12:26:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 12:26:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-10-15 12:26:56,164 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 184 [2018-10-15 12:26:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:56,164 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-10-15 12:26:56,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:26:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-10-15 12:26:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 12:26:56,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:56,166 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:56,166 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:56,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash -813825524, now seen corresponding path program 23 times [2018-10-15 12:26:56,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:57,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:26:57,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:26:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:26:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:26:57,333 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 49 states. [2018-10-15 12:26:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:58,840 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2018-10-15 12:26:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:26:58,842 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 191 [2018-10-15 12:26:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:58,844 INFO L225 Difference]: With dead ends: 223 [2018-10-15 12:26:58,844 INFO L226 Difference]: Without dead ends: 223 [2018-10-15 12:26:58,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:26:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-15 12:26:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2018-10-15 12:26:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 12:26:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-10-15 12:26:58,850 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 191 [2018-10-15 12:26:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:58,850 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-10-15 12:26:58,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:26:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-10-15 12:26:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-15 12:26:58,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:58,851 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:58,852 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:58,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1144039517, now seen corresponding path program 24 times [2018-10-15 12:26:58,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 0 proven. 1956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:00,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:00,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:27:00,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:27:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:27:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:27:00,037 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 51 states. [2018-10-15 12:27:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:02,710 INFO L93 Difference]: Finished difference Result 230 states and 231 transitions. [2018-10-15 12:27:02,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:27:02,710 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-10-15 12:27:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:02,712 INFO L225 Difference]: With dead ends: 230 [2018-10-15 12:27:02,712 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 12:27:02,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:27:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 12:27:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 210. [2018-10-15 12:27:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 12:27:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-10-15 12:27:02,717 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 198 [2018-10-15 12:27:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:02,718 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-10-15 12:27:02,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:27:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-10-15 12:27:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 12:27:02,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:02,719 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:02,720 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:02,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:02,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1944724948, now seen corresponding path program 25 times [2018-10-15 12:27:02,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 0 proven. 2125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:04,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:04,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:27:04,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:27:04,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:27:04,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:27:04,112 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 53 states. [2018-10-15 12:27:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:05,822 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-10-15 12:27:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:27:05,822 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 205 [2018-10-15 12:27:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:05,825 INFO L225 Difference]: With dead ends: 237 [2018-10-15 12:27:05,825 INFO L226 Difference]: Without dead ends: 237 [2018-10-15 12:27:05,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:27:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-15 12:27:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2018-10-15 12:27:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 12:27:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-15 12:27:05,830 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 205 [2018-10-15 12:27:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:05,831 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-15 12:27:05,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:27:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-15 12:27:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 12:27:05,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:05,832 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:05,832 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:05,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:05,833 INFO L82 PathProgramCache]: Analyzing trace with hash -245752957, now seen corresponding path program 26 times [2018-10-15 12:27:05,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:07,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:07,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:27:07,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:27:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:27:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:27:07,593 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 55 states. [2018-10-15 12:27:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:09,675 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2018-10-15 12:27:09,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:27:09,676 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2018-10-15 12:27:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:09,678 INFO L225 Difference]: With dead ends: 244 [2018-10-15 12:27:09,678 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 12:27:09,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:27:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 12:27:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 224. [2018-10-15 12:27:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:27:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2018-10-15 12:27:09,683 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 212 [2018-10-15 12:27:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:09,683 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2018-10-15 12:27:09,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:27:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2018-10-15 12:27:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:27:09,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:09,685 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:09,685 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:09,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1367407180, now seen corresponding path program 27 times [2018-10-15 12:27:09,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2484 backedges. 0 proven. 2484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:11,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:11,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:27:11,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:27:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:27:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:27:11,206 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 57 states. [2018-10-15 12:27:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:13,246 INFO L93 Difference]: Finished difference Result 251 states and 252 transitions. [2018-10-15 12:27:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:27:13,247 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 219 [2018-10-15 12:27:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:13,249 INFO L225 Difference]: With dead ends: 251 [2018-10-15 12:27:13,249 INFO L226 Difference]: Without dead ends: 251 [2018-10-15 12:27:13,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:27:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-15 12:27:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-10-15 12:27:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 12:27:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-10-15 12:27:13,255 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 219 [2018-10-15 12:27:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:13,255 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-10-15 12:27:13,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:27:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-10-15 12:27:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:27:13,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:13,256 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:13,257 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:13,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1867552611, now seen corresponding path program 28 times [2018-10-15 12:27:13,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2674 backedges. 0 proven. 2674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:17,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:17,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:27:17,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:27:17,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:27:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:27:17,378 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2018-10-15 12:27:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:19,271 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2018-10-15 12:27:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:27:19,271 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 226 [2018-10-15 12:27:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:19,273 INFO L225 Difference]: With dead ends: 258 [2018-10-15 12:27:19,273 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 12:27:19,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:27:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 12:27:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2018-10-15 12:27:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-15 12:27:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-10-15 12:27:19,279 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 226 [2018-10-15 12:27:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:19,279 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-10-15 12:27:19,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:27:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-10-15 12:27:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 12:27:19,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:19,281 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:19,281 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:19,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1751212652, now seen corresponding path program 29 times [2018-10-15 12:27:19,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 0 proven. 2871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:20,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:20,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:27:20,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:27:20,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:27:20,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:27:20,434 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 61 states. [2018-10-15 12:27:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:22,779 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2018-10-15 12:27:22,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:27:22,779 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 233 [2018-10-15 12:27:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:22,781 INFO L225 Difference]: With dead ends: 265 [2018-10-15 12:27:22,781 INFO L226 Difference]: Without dead ends: 265 [2018-10-15 12:27:22,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:27:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-15 12:27:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 245. [2018-10-15 12:27:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 12:27:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-10-15 12:27:22,786 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 233 [2018-10-15 12:27:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:22,786 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-10-15 12:27:22,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:27:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-10-15 12:27:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 12:27:22,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:22,788 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:22,788 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:22,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1389415235, now seen corresponding path program 30 times [2018-10-15 12:27:22,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 0 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:24,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:24,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:27:24,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:27:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:27:24,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:27:24,958 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 63 states. [2018-10-15 12:27:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:27,199 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-10-15 12:27:27,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:27:27,199 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 240 [2018-10-15 12:27:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:27,200 INFO L225 Difference]: With dead ends: 272 [2018-10-15 12:27:27,200 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 12:27:27,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:27:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 12:27:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2018-10-15 12:27:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-15 12:27:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 253 transitions. [2018-10-15 12:27:27,206 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 253 transitions. Word has length 240 [2018-10-15 12:27:27,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:27,206 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 253 transitions. [2018-10-15 12:27:27,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:27:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 253 transitions. [2018-10-15 12:27:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 12:27:27,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:27,207 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:27,207 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:27,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:27,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1440289420, now seen corresponding path program 31 times [2018-10-15 12:27:27,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3286 backedges. 0 proven. 3286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:28,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:28,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:27:28,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:27:28,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:27:28,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:27:28,598 INFO L87 Difference]: Start difference. First operand 252 states and 253 transitions. Second operand 65 states. [2018-10-15 12:27:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:30,904 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2018-10-15 12:27:30,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:27:30,904 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 247 [2018-10-15 12:27:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:30,906 INFO L225 Difference]: With dead ends: 279 [2018-10-15 12:27:30,906 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:27:30,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:27:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:27:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 259. [2018-10-15 12:27:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 12:27:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-15 12:27:30,912 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 247 [2018-10-15 12:27:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:30,912 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-15 12:27:30,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:27:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-15 12:27:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-15 12:27:30,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:30,914 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:30,914 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:30,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1819850531, now seen corresponding path program 32 times [2018-10-15 12:27:30,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 0 proven. 3504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:32,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:32,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:27:32,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:27:32,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:27:32,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:27:32,373 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 67 states. [2018-10-15 12:27:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:34,960 INFO L93 Difference]: Finished difference Result 286 states and 287 transitions. [2018-10-15 12:27:34,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:27:34,961 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 254 [2018-10-15 12:27:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:34,965 INFO L225 Difference]: With dead ends: 286 [2018-10-15 12:27:34,965 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 12:27:34,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:27:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 12:27:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 266. [2018-10-15 12:27:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:27:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2018-10-15 12:27:34,971 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 254 [2018-10-15 12:27:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:34,971 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2018-10-15 12:27:34,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:27:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2018-10-15 12:27:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-15 12:27:34,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:34,974 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:34,974 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:34,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:34,974 INFO L82 PathProgramCache]: Analyzing trace with hash -74839380, now seen corresponding path program 33 times [2018-10-15 12:27:34,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3729 backedges. 0 proven. 3729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:37,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:37,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:27:37,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:27:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:27:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:27:37,302 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 69 states. [2018-10-15 12:27:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:40,080 INFO L93 Difference]: Finished difference Result 293 states and 294 transitions. [2018-10-15 12:27:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:27:40,080 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 261 [2018-10-15 12:27:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:40,082 INFO L225 Difference]: With dead ends: 293 [2018-10-15 12:27:40,082 INFO L226 Difference]: Without dead ends: 293 [2018-10-15 12:27:40,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:27:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-15 12:27:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 273. [2018-10-15 12:27:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 12:27:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-10-15 12:27:40,087 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 261 [2018-10-15 12:27:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:40,087 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-10-15 12:27:40,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:27:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-10-15 12:27:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 12:27:40,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:40,088 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:40,089 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:40,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 543578883, now seen corresponding path program 34 times [2018-10-15 12:27:40,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 0 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:42,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:42,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:27:42,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:27:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:27:42,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:27:42,024 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 71 states. [2018-10-15 12:27:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:44,941 INFO L93 Difference]: Finished difference Result 300 states and 301 transitions. [2018-10-15 12:27:44,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:27:44,941 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 268 [2018-10-15 12:27:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:44,943 INFO L225 Difference]: With dead ends: 300 [2018-10-15 12:27:44,943 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 12:27:44,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:27:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 12:27:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 280. [2018-10-15 12:27:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 12:27:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-10-15 12:27:44,949 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 268 [2018-10-15 12:27:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:44,950 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-10-15 12:27:44,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:27:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-10-15 12:27:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-15 12:27:44,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:44,951 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:44,951 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:44,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:44,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1214887220, now seen corresponding path program 35 times [2018-10-15 12:27:44,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 0 proven. 4200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:46,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:46,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:27:46,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:27:46,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:27:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:27:46,686 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 73 states. [2018-10-15 12:27:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:49,622 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-10-15 12:27:49,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:27:49,623 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 275 [2018-10-15 12:27:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:49,624 INFO L225 Difference]: With dead ends: 307 [2018-10-15 12:27:49,624 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 12:27:49,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:27:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 12:27:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2018-10-15 12:27:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-15 12:27:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-15 12:27:49,630 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 275 [2018-10-15 12:27:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:49,630 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-15 12:27:49,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:27:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-15 12:27:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 12:27:49,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:49,631 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:49,632 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:49,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:49,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1178056419, now seen corresponding path program 36 times [2018-10-15 12:27:49,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4446 backedges. 0 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:51,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:51,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:27:51,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:27:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:27:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:27:51,473 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 75 states. [2018-10-15 12:27:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:54,786 INFO L93 Difference]: Finished difference Result 314 states and 315 transitions. [2018-10-15 12:27:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:27:54,787 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 282 [2018-10-15 12:27:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:54,788 INFO L225 Difference]: With dead ends: 314 [2018-10-15 12:27:54,788 INFO L226 Difference]: Without dead ends: 314 [2018-10-15 12:27:54,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:27:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-15 12:27:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 294. [2018-10-15 12:27:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 12:27:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-10-15 12:27:54,794 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 282 [2018-10-15 12:27:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:54,794 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-10-15 12:27:54,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:27:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-10-15 12:27:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:27:54,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:54,796 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:54,796 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:54,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:54,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2069900564, now seen corresponding path program 37 times [2018-10-15 12:27:54,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4699 backedges. 0 proven. 4699 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:56,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:27:56,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:27:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:27:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:27:56,685 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 77 states. [2018-10-15 12:28:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:00,172 INFO L93 Difference]: Finished difference Result 321 states and 322 transitions. [2018-10-15 12:28:00,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:28:00,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 289 [2018-10-15 12:28:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:00,175 INFO L225 Difference]: With dead ends: 321 [2018-10-15 12:28:00,175 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 12:28:00,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:28:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 12:28:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 301. [2018-10-15 12:28:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-15 12:28:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-10-15 12:28:00,180 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 289 [2018-10-15 12:28:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:00,181 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-10-15 12:28:00,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:28:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-10-15 12:28:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 12:28:00,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:00,183 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:00,183 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:00,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:00,183 INFO L82 PathProgramCache]: Analyzing trace with hash 151702211, now seen corresponding path program 38 times [2018-10-15 12:28:00,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:02,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:02,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:28:02,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:28:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:28:02,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:28:02,813 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 79 states. [2018-10-15 12:28:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:06,294 INFO L93 Difference]: Finished difference Result 328 states and 329 transitions. [2018-10-15 12:28:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:28:06,295 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 296 [2018-10-15 12:28:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:06,296 INFO L225 Difference]: With dead ends: 328 [2018-10-15 12:28:06,297 INFO L226 Difference]: Without dead ends: 328 [2018-10-15 12:28:06,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:28:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-15 12:28:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 308. [2018-10-15 12:28:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:28:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2018-10-15 12:28:06,302 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 296 [2018-10-15 12:28:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:06,302 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2018-10-15 12:28:06,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:28:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2018-10-15 12:28:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-15 12:28:06,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:06,304 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:06,304 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:06,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash 432579340, now seen corresponding path program 39 times [2018-10-15 12:28:06,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5226 backedges. 0 proven. 5226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:08,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:08,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:28:08,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:28:08,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:28:08,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:28:08,912 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 81 states. [2018-10-15 12:28:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:12,286 INFO L93 Difference]: Finished difference Result 335 states and 336 transitions. [2018-10-15 12:28:12,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:28:12,286 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 303 [2018-10-15 12:28:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:12,288 INFO L225 Difference]: With dead ends: 335 [2018-10-15 12:28:12,288 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 12:28:12,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:28:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 12:28:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 315. [2018-10-15 12:28:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 12:28:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-15 12:28:12,295 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 303 [2018-10-15 12:28:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:12,295 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-15 12:28:12,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:28:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-15 12:28:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-15 12:28:12,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:12,297 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:12,297 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:12,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:12,297 INFO L82 PathProgramCache]: Analyzing trace with hash -948070749, now seen corresponding path program 40 times [2018-10-15 12:28:12,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5500 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:14,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:14,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:28:14,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:28:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:28:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:28:14,609 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 83 states. [2018-10-15 12:28:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:18,171 INFO L93 Difference]: Finished difference Result 342 states and 343 transitions. [2018-10-15 12:28:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:28:18,171 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 310 [2018-10-15 12:28:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:18,173 INFO L225 Difference]: With dead ends: 342 [2018-10-15 12:28:18,174 INFO L226 Difference]: Without dead ends: 342 [2018-10-15 12:28:18,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:28:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-15 12:28:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 322. [2018-10-15 12:28:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-15 12:28:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 323 transitions. [2018-10-15 12:28:18,178 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 323 transitions. Word has length 310 [2018-10-15 12:28:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:18,178 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 323 transitions. [2018-10-15 12:28:18,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:28:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 323 transitions. [2018-10-15 12:28:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-15 12:28:18,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:18,179 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:18,179 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:18,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 179485484, now seen corresponding path program 41 times [2018-10-15 12:28:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5781 backedges. 0 proven. 5781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:20,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:20,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:28:20,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:28:20,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:28:20,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:28:20,458 INFO L87 Difference]: Start difference. First operand 322 states and 323 transitions. Second operand 85 states. [2018-10-15 12:28:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:24,443 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-10-15 12:28:24,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:28:24,443 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 317 [2018-10-15 12:28:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:24,445 INFO L225 Difference]: With dead ends: 349 [2018-10-15 12:28:24,445 INFO L226 Difference]: Without dead ends: 349 [2018-10-15 12:28:24,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:28:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-15 12:28:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 329. [2018-10-15 12:28:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-15 12:28:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-10-15 12:28:24,450 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 317 [2018-10-15 12:28:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:24,451 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-10-15 12:28:24,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:28:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-10-15 12:28:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-15 12:28:24,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:24,453 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:24,453 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:24,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash -206693757, now seen corresponding path program 42 times [2018-10-15 12:28:24,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 0 proven. 6069 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:26,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:26,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:28:26,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:28:26,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:28:26,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:28:26,748 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 87 states. [2018-10-15 12:28:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:31,185 INFO L93 Difference]: Finished difference Result 356 states and 357 transitions. [2018-10-15 12:28:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:28:31,186 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 324 [2018-10-15 12:28:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:31,187 INFO L225 Difference]: With dead ends: 356 [2018-10-15 12:28:31,187 INFO L226 Difference]: Without dead ends: 356 [2018-10-15 12:28:31,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:28:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-15 12:28:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 336. [2018-10-15 12:28:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-15 12:28:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2018-10-15 12:28:31,192 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 324 [2018-10-15 12:28:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:31,193 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2018-10-15 12:28:31,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:28:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2018-10-15 12:28:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-15 12:28:31,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:31,195 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:31,195 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:31,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:31,195 INFO L82 PathProgramCache]: Analyzing trace with hash -411034804, now seen corresponding path program 43 times [2018-10-15 12:28:31,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6364 backedges. 0 proven. 6364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:33,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:33,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:28:33,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:28:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:28:33,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:28:33,612 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 89 states. [2018-10-15 12:28:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:37,816 INFO L93 Difference]: Finished difference Result 363 states and 364 transitions. [2018-10-15 12:28:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:28:37,817 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 331 [2018-10-15 12:28:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:37,819 INFO L225 Difference]: With dead ends: 363 [2018-10-15 12:28:37,819 INFO L226 Difference]: Without dead ends: 363 [2018-10-15 12:28:37,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:28:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-15 12:28:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 343. [2018-10-15 12:28:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-15 12:28:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-10-15 12:28:37,824 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 331 [2018-10-15 12:28:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:37,824 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-10-15 12:28:37,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:28:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-10-15 12:28:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-15 12:28:37,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:37,826 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:37,826 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:37,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:37,827 INFO L82 PathProgramCache]: Analyzing trace with hash -214280605, now seen corresponding path program 44 times [2018-10-15 12:28:37,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6666 backedges. 0 proven. 6666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:40,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:40,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:28:40,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:28:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:28:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:28:40,498 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 91 states. [2018-10-15 12:28:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:45,259 INFO L93 Difference]: Finished difference Result 370 states and 371 transitions. [2018-10-15 12:28:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:28:45,259 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 338 [2018-10-15 12:28:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:45,261 INFO L225 Difference]: With dead ends: 370 [2018-10-15 12:28:45,261 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 12:28:45,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:28:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 12:28:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 350. [2018-10-15 12:28:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:28:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 351 transitions. [2018-10-15 12:28:45,267 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 351 transitions. Word has length 338 [2018-10-15 12:28:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:45,267 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 351 transitions. [2018-10-15 12:28:45,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:28:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 351 transitions. [2018-10-15 12:28:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-15 12:28:45,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:45,269 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:45,270 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:45,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1557316460, now seen corresponding path program 45 times [2018-10-15 12:28:45,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6975 backedges. 0 proven. 6975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:48,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:48,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:28:48,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:28:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:28:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:28:48,378 INFO L87 Difference]: Start difference. First operand 350 states and 351 transitions. Second operand 93 states. [2018-10-15 12:28:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:53,002 INFO L93 Difference]: Finished difference Result 377 states and 378 transitions. [2018-10-15 12:28:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:28:53,003 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 345 [2018-10-15 12:28:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:53,005 INFO L225 Difference]: With dead ends: 377 [2018-10-15 12:28:53,005 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 12:28:53,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:28:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 12:28:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2018-10-15 12:28:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-15 12:28:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-10-15 12:28:53,011 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 345 [2018-10-15 12:28:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:53,011 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-10-15 12:28:53,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:28:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-10-15 12:28:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 12:28:53,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:53,013 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:53,014 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:53,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash -12563901, now seen corresponding path program 46 times [2018-10-15 12:28:53,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7291 backedges. 0 proven. 7291 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:56,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:56,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:28:56,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:28:56,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:28:56,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:28:56,413 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 95 states. [2018-10-15 12:29:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:01,251 INFO L93 Difference]: Finished difference Result 384 states and 385 transitions. [2018-10-15 12:29:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:29:01,251 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 352 [2018-10-15 12:29:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:01,253 INFO L225 Difference]: With dead ends: 384 [2018-10-15 12:29:01,253 INFO L226 Difference]: Without dead ends: 384 [2018-10-15 12:29:01,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:29:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-15 12:29:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 364. [2018-10-15 12:29:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-15 12:29:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 365 transitions. [2018-10-15 12:29:01,257 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 365 transitions. Word has length 352 [2018-10-15 12:29:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:01,258 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 365 transitions. [2018-10-15 12:29:01,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:29:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 365 transitions. [2018-10-15 12:29:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:29:01,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:01,260 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:01,260 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:01,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1405924236, now seen corresponding path program 47 times [2018-10-15 12:29:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7614 backedges. 0 proven. 7614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:03,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:03,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:29:03,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:29:03,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:29:03,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:29:03,997 INFO L87 Difference]: Start difference. First operand 364 states and 365 transitions. Second operand 97 states. [2018-10-15 12:29:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:08,952 INFO L93 Difference]: Finished difference Result 391 states and 392 transitions. [2018-10-15 12:29:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:29:08,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 359 [2018-10-15 12:29:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:08,955 INFO L225 Difference]: With dead ends: 391 [2018-10-15 12:29:08,955 INFO L226 Difference]: Without dead ends: 391 [2018-10-15 12:29:08,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:29:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-15 12:29:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 371. [2018-10-15 12:29:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 12:29:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-10-15 12:29:08,961 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 359 [2018-10-15 12:29:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:08,961 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-10-15 12:29:08,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:29:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-10-15 12:29:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-15 12:29:08,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:08,964 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:08,964 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:08,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash 73266723, now seen corresponding path program 48 times [2018-10-15 12:29:08,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7944 backedges. 0 proven. 7944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:12,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:12,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:29:12,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:29:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:29:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:29:12,142 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 99 states. [2018-10-15 12:29:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:17,560 INFO L93 Difference]: Finished difference Result 398 states and 399 transitions. [2018-10-15 12:29:17,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:29:17,561 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 366 [2018-10-15 12:29:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:17,562 INFO L225 Difference]: With dead ends: 398 [2018-10-15 12:29:17,562 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 12:29:17,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:29:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 12:29:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 378. [2018-10-15 12:29:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-15 12:29:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-10-15 12:29:17,567 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 366 [2018-10-15 12:29:17,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:17,568 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-10-15 12:29:17,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:29:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-10-15 12:29:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 12:29:17,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:17,569 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:17,570 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:17,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:17,570 INFO L82 PathProgramCache]: Analyzing trace with hash 303033260, now seen corresponding path program 49 times [2018-10-15 12:29:17,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:20,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:20,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:29:20,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:29:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:29:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:29:20,856 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 101 states. [2018-10-15 12:29:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:26,500 INFO L93 Difference]: Finished difference Result 405 states and 406 transitions. [2018-10-15 12:29:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:29:26,500 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 373 [2018-10-15 12:29:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:26,501 INFO L225 Difference]: With dead ends: 405 [2018-10-15 12:29:26,502 INFO L226 Difference]: Without dead ends: 405 [2018-10-15 12:29:26,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:29:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-15 12:29:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 385. [2018-10-15 12:29:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-15 12:29:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-10-15 12:29:26,508 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 373 [2018-10-15 12:29:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:26,509 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-10-15 12:29:26,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:29:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-10-15 12:29:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-15 12:29:26,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:26,511 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:26,511 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:26,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2102306301, now seen corresponding path program 50 times [2018-10-15 12:29:26,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8625 backedges. 0 proven. 8625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:29,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:29,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:29:29,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:29:29,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:29:29,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:29:29,832 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 103 states. [2018-10-15 12:29:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:35,593 INFO L93 Difference]: Finished difference Result 412 states and 413 transitions. [2018-10-15 12:29:35,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:29:35,595 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 380 [2018-10-15 12:29:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:35,598 INFO L225 Difference]: With dead ends: 412 [2018-10-15 12:29:35,598 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 12:29:35,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:29:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 12:29:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 392. [2018-10-15 12:29:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:29:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2018-10-15 12:29:35,603 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 380 [2018-10-15 12:29:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:35,604 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2018-10-15 12:29:35,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:29:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2018-10-15 12:29:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-15 12:29:35,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:35,606 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:35,606 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:35,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1505651660, now seen corresponding path program 51 times [2018-10-15 12:29:35,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 0 proven. 8976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:38,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:38,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:29:38,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:29:38,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:29:38,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:29:38,896 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 105 states. [2018-10-15 12:29:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:44,795 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-10-15 12:29:44,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:29:44,795 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 387 [2018-10-15 12:29:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:44,797 INFO L225 Difference]: With dead ends: 419 [2018-10-15 12:29:44,797 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 12:29:44,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:29:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 12:29:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 399. [2018-10-15 12:29:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-15 12:29:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-10-15 12:29:44,803 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 387 [2018-10-15 12:29:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:44,803 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-10-15 12:29:44,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:29:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-10-15 12:29:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-15 12:29:44,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:44,805 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:44,805 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:44,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1842902499, now seen corresponding path program 52 times [2018-10-15 12:29:44,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9334 backedges. 0 proven. 9334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:48,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:48,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:29:48,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:29:48,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:29:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:29:48,741 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 107 states. [2018-10-15 12:29:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:54,984 INFO L93 Difference]: Finished difference Result 426 states and 427 transitions. [2018-10-15 12:29:54,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:29:54,984 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 394 [2018-10-15 12:29:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:54,986 INFO L225 Difference]: With dead ends: 426 [2018-10-15 12:29:54,986 INFO L226 Difference]: Without dead ends: 426 [2018-10-15 12:29:54,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:29:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-15 12:29:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 406. [2018-10-15 12:29:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-15 12:29:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 407 transitions. [2018-10-15 12:29:54,990 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 407 transitions. Word has length 394 [2018-10-15 12:29:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:54,991 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 407 transitions. [2018-10-15 12:29:54,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:29:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 407 transitions. [2018-10-15 12:29:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-15 12:29:54,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:54,993 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:54,993 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:54,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:54,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1988480020, now seen corresponding path program 53 times [2018-10-15 12:29:54,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9699 backedges. 0 proven. 9699 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:58,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:58,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:29:58,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:29:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:29:58,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:29:58,761 INFO L87 Difference]: Start difference. First operand 406 states and 407 transitions. Second operand 109 states. [2018-10-15 12:30:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:05,342 INFO L93 Difference]: Finished difference Result 433 states and 434 transitions. [2018-10-15 12:30:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:30:05,343 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 401 [2018-10-15 12:30:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:05,344 INFO L225 Difference]: With dead ends: 433 [2018-10-15 12:30:05,344 INFO L226 Difference]: Without dead ends: 433 [2018-10-15 12:30:05,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:30:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-15 12:30:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 413. [2018-10-15 12:30:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-15 12:30:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-10-15 12:30:05,349 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 401 [2018-10-15 12:30:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:05,349 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-10-15 12:30:05,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:30:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-10-15 12:30:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-15 12:30:05,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:05,351 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:05,351 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:05,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 217139651, now seen corresponding path program 54 times [2018-10-15 12:30:05,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10071 backedges. 0 proven. 10071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:09,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:30:09,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:30:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:30:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:30:09,031 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 111 states. [2018-10-15 12:30:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:15,650 INFO L93 Difference]: Finished difference Result 440 states and 441 transitions. [2018-10-15 12:30:15,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:30:15,650 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 408 [2018-10-15 12:30:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:15,652 INFO L225 Difference]: With dead ends: 440 [2018-10-15 12:30:15,652 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 12:30:15,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:30:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 12:30:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 420. [2018-10-15 12:30:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 12:30:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-10-15 12:30:15,657 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 408 [2018-10-15 12:30:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:15,657 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-10-15 12:30:15,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:30:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-10-15 12:30:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-15 12:30:15,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:15,659 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:15,659 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:15,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1134214132, now seen corresponding path program 55 times [2018-10-15 12:30:15,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10450 backedges. 0 proven. 10450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:19,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:19,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:30:19,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:30:19,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:30:19,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:30:19,560 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 113 states. [2018-10-15 12:30:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:26,804 INFO L93 Difference]: Finished difference Result 447 states and 448 transitions. [2018-10-15 12:30:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:30:26,805 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 415 [2018-10-15 12:30:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:26,807 INFO L225 Difference]: With dead ends: 447 [2018-10-15 12:30:26,807 INFO L226 Difference]: Without dead ends: 447 [2018-10-15 12:30:26,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:30:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-15 12:30:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 427. [2018-10-15 12:30:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-15 12:30:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-10-15 12:30:26,811 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 415 [2018-10-15 12:30:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:26,811 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-10-15 12:30:26,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:30:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-10-15 12:30:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-15 12:30:26,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:26,813 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:26,813 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:26,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash -627452509, now seen corresponding path program 56 times [2018-10-15 12:30:26,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10836 backedges. 0 proven. 10836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:30,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:30,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:30:30,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:30:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:30:30,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:30:31,000 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 115 states. [2018-10-15 12:30:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:38,165 INFO L93 Difference]: Finished difference Result 454 states and 455 transitions. [2018-10-15 12:30:38,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:30:38,166 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 422 [2018-10-15 12:30:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:38,167 INFO L225 Difference]: With dead ends: 454 [2018-10-15 12:30:38,168 INFO L226 Difference]: Without dead ends: 454 [2018-10-15 12:30:38,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:30:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-15 12:30:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2018-10-15 12:30:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:30:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-10-15 12:30:38,172 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 422 [2018-10-15 12:30:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:38,173 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-10-15 12:30:38,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:30:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-10-15 12:30:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:30:38,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:38,175 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:38,175 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:38,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash -366896084, now seen corresponding path program 57 times [2018-10-15 12:30:38,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11229 backedges. 0 proven. 11229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:42,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:42,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:30:42,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:30:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:30:42,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:30:42,191 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 117 states. [2018-10-15 12:30:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:49,185 INFO L93 Difference]: Finished difference Result 461 states and 462 transitions. [2018-10-15 12:30:49,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:30:49,186 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 429 [2018-10-15 12:30:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:49,189 INFO L225 Difference]: With dead ends: 461 [2018-10-15 12:30:49,189 INFO L226 Difference]: Without dead ends: 461 [2018-10-15 12:30:49,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:30:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-15 12:30:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 441. [2018-10-15 12:30:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-15 12:30:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-10-15 12:30:49,194 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 429 [2018-10-15 12:30:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:49,194 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-10-15 12:30:49,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:30:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-10-15 12:30:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-15 12:30:49,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:49,196 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:49,197 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:49,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1693456771, now seen corresponding path program 58 times [2018-10-15 12:30:49,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11629 backedges. 0 proven. 11629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:53,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:53,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:30:53,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:30:53,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:30:53,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:30:53,341 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 119 states. [2018-10-15 12:31:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:00,383 INFO L93 Difference]: Finished difference Result 468 states and 469 transitions. [2018-10-15 12:31:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 12:31:00,384 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 436 [2018-10-15 12:31:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:00,386 INFO L225 Difference]: With dead ends: 468 [2018-10-15 12:31:00,386 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 12:31:00,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:31:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 12:31:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 448. [2018-10-15 12:31:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-15 12:31:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2018-10-15 12:31:00,390 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 436 [2018-10-15 12:31:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:00,391 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2018-10-15 12:31:00,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:31:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2018-10-15 12:31:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-15 12:31:00,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:00,392 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:00,393 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:00,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash 114375756, now seen corresponding path program 59 times [2018-10-15 12:31:00,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12036 backedges. 0 proven. 12036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:04,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:04,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:31:04,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:31:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:31:04,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:31:04,743 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 121 states. [2018-10-15 12:31:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:12,419 INFO L93 Difference]: Finished difference Result 475 states and 476 transitions. [2018-10-15 12:31:12,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 12:31:12,419 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 443 [2018-10-15 12:31:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:12,421 INFO L225 Difference]: With dead ends: 475 [2018-10-15 12:31:12,421 INFO L226 Difference]: Without dead ends: 475 [2018-10-15 12:31:12,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 12:31:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-10-15 12:31:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 455. [2018-10-15 12:31:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-15 12:31:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-10-15 12:31:12,427 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 443 [2018-10-15 12:31:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:12,427 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-10-15 12:31:12,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 12:31:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-10-15 12:31:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-15 12:31:12,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:12,429 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:12,429 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:12,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash 764548451, now seen corresponding path program 60 times [2018-10-15 12:31:12,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12450 backedges. 0 proven. 12450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:16,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:16,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:31:16,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:31:16,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:31:16,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:31:16,675 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 123 states. [2018-10-15 12:31:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:24,338 INFO L93 Difference]: Finished difference Result 482 states and 483 transitions. [2018-10-15 12:31:24,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 12:31:24,339 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 450 [2018-10-15 12:31:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:24,341 INFO L225 Difference]: With dead ends: 482 [2018-10-15 12:31:24,341 INFO L226 Difference]: Without dead ends: 482 [2018-10-15 12:31:24,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 12:31:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-10-15 12:31:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 462. [2018-10-15 12:31:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-15 12:31:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 463 transitions. [2018-10-15 12:31:24,347 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 463 transitions. Word has length 450 [2018-10-15 12:31:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:24,347 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 463 transitions. [2018-10-15 12:31:24,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:31:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 463 transitions. [2018-10-15 12:31:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-15 12:31:24,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:24,349 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:24,350 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:24,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash 588653676, now seen corresponding path program 61 times [2018-10-15 12:31:24,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12871 backedges. 0 proven. 12871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:29,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 12:31:29,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 12:31:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 12:31:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:31:29,193 INFO L87 Difference]: Start difference. First operand 462 states and 463 transitions. Second operand 125 states. [2018-10-15 12:31:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:37,053 INFO L93 Difference]: Finished difference Result 489 states and 490 transitions. [2018-10-15 12:31:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 12:31:37,053 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 457 [2018-10-15 12:31:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:37,056 INFO L225 Difference]: With dead ends: 489 [2018-10-15 12:31:37,056 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 12:31:37,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 12:31:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 12:31:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 469. [2018-10-15 12:31:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-15 12:31:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 470 transitions. [2018-10-15 12:31:37,062 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 470 transitions. Word has length 457 [2018-10-15 12:31:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:37,062 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 470 transitions. [2018-10-15 12:31:37,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 12:31:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 470 transitions. [2018-10-15 12:31:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-15 12:31:37,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:37,064 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:37,064 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:37,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:37,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1986148029, now seen corresponding path program 62 times [2018-10-15 12:31:37,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13299 backedges. 0 proven. 13299 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:41,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 12:31:41,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 12:31:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 12:31:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:31:41,840 INFO L87 Difference]: Start difference. First operand 469 states and 470 transitions. Second operand 127 states. [2018-10-15 12:31:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:50,320 INFO L93 Difference]: Finished difference Result 496 states and 497 transitions. [2018-10-15 12:31:50,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 12:31:50,320 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 464 [2018-10-15 12:31:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:50,322 INFO L225 Difference]: With dead ends: 496 [2018-10-15 12:31:50,322 INFO L226 Difference]: Without dead ends: 496 [2018-10-15 12:31:50,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 12:31:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-10-15 12:31:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 476. [2018-10-15 12:31:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-10-15 12:31:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 477 transitions. [2018-10-15 12:31:50,328 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 477 transitions. Word has length 464 [2018-10-15 12:31:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:50,328 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 477 transitions. [2018-10-15 12:31:50,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 12:31:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 477 transitions. [2018-10-15 12:31:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-15 12:31:50,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:50,330 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:50,330 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:50,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1944955764, now seen corresponding path program 63 times [2018-10-15 12:31:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 13734 backedges. 0 proven. 13734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:55,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:55,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 12:31:55,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 12:31:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 12:31:55,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:31:55,406 INFO L87 Difference]: Start difference. First operand 476 states and 477 transitions. Second operand 129 states. [2018-10-15 12:32:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:04,288 INFO L93 Difference]: Finished difference Result 503 states and 504 transitions. [2018-10-15 12:32:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 12:32:04,289 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 471 [2018-10-15 12:32:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:04,291 INFO L225 Difference]: With dead ends: 503 [2018-10-15 12:32:04,291 INFO L226 Difference]: Without dead ends: 503 [2018-10-15 12:32:04,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 12:32:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-15 12:32:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 483. [2018-10-15 12:32:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-15 12:32:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 484 transitions. [2018-10-15 12:32:04,296 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 484 transitions. Word has length 471 [2018-10-15 12:32:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:04,296 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 484 transitions. [2018-10-15 12:32:04,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 12:32:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 484 transitions. [2018-10-15 12:32:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-15 12:32:04,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:04,299 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:04,299 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:04,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:04,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2119092957, now seen corresponding path program 64 times [2018-10-15 12:32:04,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 14176 backedges. 0 proven. 14176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:09,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:09,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 12:32:09,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 12:32:09,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 12:32:09,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:32:09,369 INFO L87 Difference]: Start difference. First operand 483 states and 484 transitions. Second operand 131 states. [2018-10-15 12:32:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:18,266 INFO L93 Difference]: Finished difference Result 510 states and 511 transitions. [2018-10-15 12:32:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 12:32:18,266 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 478 [2018-10-15 12:32:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:18,268 INFO L225 Difference]: With dead ends: 510 [2018-10-15 12:32:18,268 INFO L226 Difference]: Without dead ends: 510 [2018-10-15 12:32:18,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 12:32:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-15 12:32:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 490. [2018-10-15 12:32:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-15 12:32:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 491 transitions. [2018-10-15 12:32:18,273 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 491 transitions. Word has length 478 [2018-10-15 12:32:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:18,274 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 491 transitions. [2018-10-15 12:32:18,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 12:32:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 491 transitions. [2018-10-15 12:32:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-10-15 12:32:18,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:18,276 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:18,276 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:18,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash -345518932, now seen corresponding path program 65 times [2018-10-15 12:32:18,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14625 backedges. 0 proven. 14625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:23,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:23,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:32:23,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:32:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:32:23,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:32:23,588 INFO L87 Difference]: Start difference. First operand 490 states and 491 transitions. Second operand 133 states. [2018-10-15 12:32:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:32,748 INFO L93 Difference]: Finished difference Result 517 states and 518 transitions. [2018-10-15 12:32:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 12:32:32,749 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 485 [2018-10-15 12:32:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:32,751 INFO L225 Difference]: With dead ends: 517 [2018-10-15 12:32:32,751 INFO L226 Difference]: Without dead ends: 517 [2018-10-15 12:32:32,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:32:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-15 12:32:32,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 497. [2018-10-15 12:32:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-10-15 12:32:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 498 transitions. [2018-10-15 12:32:32,756 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 498 transitions. Word has length 485 [2018-10-15 12:32:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:32,757 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 498 transitions. [2018-10-15 12:32:32,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:32:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 498 transitions. [2018-10-15 12:32:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-15 12:32:32,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:32,759 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:32,759 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:32,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1310041853, now seen corresponding path program 66 times [2018-10-15 12:32:32,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15081 backedges. 0 proven. 15081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:38,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:38,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 12:32:38,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 12:32:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 12:32:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:32:38,117 INFO L87 Difference]: Start difference. First operand 497 states and 498 transitions. Second operand 135 states. [2018-10-15 12:32:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:47,688 INFO L93 Difference]: Finished difference Result 524 states and 525 transitions. [2018-10-15 12:32:47,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 12:32:47,688 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 492 [2018-10-15 12:32:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:47,690 INFO L225 Difference]: With dead ends: 524 [2018-10-15 12:32:47,690 INFO L226 Difference]: Without dead ends: 524 [2018-10-15 12:32:47,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 12:32:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-15 12:32:47,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 504. [2018-10-15 12:32:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-15 12:32:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2018-10-15 12:32:47,696 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 492 [2018-10-15 12:32:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:47,696 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2018-10-15 12:32:47,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 12:32:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2018-10-15 12:32:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 12:32:47,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:47,698 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:47,699 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:47,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:47,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1731759308, now seen corresponding path program 67 times [2018-10-15 12:32:47,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15544 backedges. 0 proven. 15544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:53,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:53,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 12:32:53,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 12:32:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 12:32:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:32:53,309 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 137 states. [2018-10-15 12:33:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:03,016 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-10-15 12:33:03,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 12:33:03,016 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 499 [2018-10-15 12:33:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:03,018 INFO L225 Difference]: With dead ends: 531 [2018-10-15 12:33:03,018 INFO L226 Difference]: Without dead ends: 531 [2018-10-15 12:33:03,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 12:33:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-15 12:33:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 511. [2018-10-15 12:33:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-15 12:33:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-10-15 12:33:03,023 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 499 [2018-10-15 12:33:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:03,024 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-10-15 12:33:03,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 12:33:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-10-15 12:33:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-15 12:33:03,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:03,026 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:03,026 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:03,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash 703018211, now seen corresponding path program 68 times [2018-10-15 12:33:03,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16014 backedges. 0 proven. 16014 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:08,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:08,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 12:33:08,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 12:33:08,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 12:33:08,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:33:08,673 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 139 states. [2018-10-15 12:33:18,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:18,390 INFO L93 Difference]: Finished difference Result 538 states and 539 transitions. [2018-10-15 12:33:18,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 12:33:18,390 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 506 [2018-10-15 12:33:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:18,392 INFO L225 Difference]: With dead ends: 538 [2018-10-15 12:33:18,392 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 12:33:18,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 12:33:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 12:33:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 518. [2018-10-15 12:33:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-15 12:33:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 519 transitions. [2018-10-15 12:33:18,398 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 519 transitions. Word has length 506 [2018-10-15 12:33:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:18,398 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 519 transitions. [2018-10-15 12:33:18,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 12:33:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 519 transitions. [2018-10-15 12:33:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-10-15 12:33:18,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:18,401 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:18,401 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:18,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:18,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1037658900, now seen corresponding path program 69 times [2018-10-15 12:33:18,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16491 backedges. 0 proven. 16491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:24,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:24,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 12:33:24,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 12:33:24,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 12:33:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 12:33:24,224 INFO L87 Difference]: Start difference. First operand 518 states and 519 transitions. Second operand 141 states. [2018-10-15 12:33:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:34,738 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2018-10-15 12:33:34,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 12:33:34,739 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 513 [2018-10-15 12:33:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:34,741 INFO L225 Difference]: With dead ends: 545 [2018-10-15 12:33:34,741 INFO L226 Difference]: Without dead ends: 545 [2018-10-15 12:33:34,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 12:33:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-15 12:33:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 525. [2018-10-15 12:33:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-10-15 12:33:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 526 transitions. [2018-10-15 12:33:34,747 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 526 transitions. Word has length 513 [2018-10-15 12:33:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:34,748 INFO L481 AbstractCegarLoop]: Abstraction has 525 states and 526 transitions. [2018-10-15 12:33:34,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 12:33:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 526 transitions. [2018-10-15 12:33:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-15 12:33:34,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:34,750 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:34,750 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:34,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1288030403, now seen corresponding path program 70 times [2018-10-15 12:33:34,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16975 backedges. 0 proven. 16975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:40,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:40,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 12:33:40,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 12:33:40,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 12:33:40,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:33:40,739 INFO L87 Difference]: Start difference. First operand 525 states and 526 transitions. Second operand 143 states. [2018-10-15 12:33:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:51,543 INFO L93 Difference]: Finished difference Result 552 states and 553 transitions. [2018-10-15 12:33:51,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 12:33:51,543 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 520 [2018-10-15 12:33:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:51,546 INFO L225 Difference]: With dead ends: 552 [2018-10-15 12:33:51,546 INFO L226 Difference]: Without dead ends: 552 [2018-10-15 12:33:51,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 12:33:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-15 12:33:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 532. [2018-10-15 12:33:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-10-15 12:33:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 533 transitions. [2018-10-15 12:33:51,551 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 533 transitions. Word has length 520 [2018-10-15 12:33:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:51,552 INFO L481 AbstractCegarLoop]: Abstraction has 532 states and 533 transitions. [2018-10-15 12:33:51,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 12:33:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 533 transitions. [2018-10-15 12:33:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 12:33:51,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:51,554 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:51,554 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:51,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2069095692, now seen corresponding path program 71 times [2018-10-15 12:33:51,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17466 backedges. 0 proven. 17466 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:57,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:57,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 12:33:57,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 12:33:57,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 12:33:57,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 12:33:57,722 INFO L87 Difference]: Start difference. First operand 532 states and 533 transitions. Second operand 145 states. [2018-10-15 12:34:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:08,771 INFO L93 Difference]: Finished difference Result 559 states and 560 transitions. [2018-10-15 12:34:08,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 12:34:08,772 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 527 [2018-10-15 12:34:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:08,774 INFO L225 Difference]: With dead ends: 559 [2018-10-15 12:34:08,774 INFO L226 Difference]: Without dead ends: 559 [2018-10-15 12:34:08,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 12:34:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-15 12:34:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 539. [2018-10-15 12:34:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-15 12:34:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 540 transitions. [2018-10-15 12:34:08,779 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 540 transitions. Word has length 527 [2018-10-15 12:34:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:08,780 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 540 transitions. [2018-10-15 12:34:08,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 12:34:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 540 transitions. [2018-10-15 12:34:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-15 12:34:08,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:08,782 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:08,782 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:08,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:08,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1323035485, now seen corresponding path program 72 times [2018-10-15 12:34:08,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 17964 backedges. 0 proven. 17964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:15,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:15,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 12:34:15,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 12:34:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 12:34:15,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:34:15,133 INFO L87 Difference]: Start difference. First operand 539 states and 540 transitions. Second operand 147 states. [2018-10-15 12:34:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:26,391 INFO L93 Difference]: Finished difference Result 566 states and 567 transitions. [2018-10-15 12:34:26,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 12:34:26,392 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 534 [2018-10-15 12:34:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:26,393 INFO L225 Difference]: With dead ends: 566 [2018-10-15 12:34:26,393 INFO L226 Difference]: Without dead ends: 566 [2018-10-15 12:34:26,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 12:34:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-10-15 12:34:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 546. [2018-10-15 12:34:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-10-15 12:34:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 547 transitions. [2018-10-15 12:34:26,399 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 547 transitions. Word has length 534 [2018-10-15 12:34:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:26,399 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 547 transitions. [2018-10-15 12:34:26,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 12:34:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 547 transitions. [2018-10-15 12:34:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-10-15 12:34:26,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:26,402 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:26,402 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:26,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash -295535316, now seen corresponding path program 73 times [2018-10-15 12:34:26,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18469 backedges. 0 proven. 18469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:33,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:33,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 12:34:33,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 12:34:33,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 12:34:33,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 12:34:33,092 INFO L87 Difference]: Start difference. First operand 546 states and 547 transitions. Second operand 149 states.