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/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:10:52,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:10:52,971 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:10:52,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:10:52,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:10:52,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:10:52,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:10:52,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:10:52,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:10:52,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:10:52,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:10:52,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:10:52,994 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:10:52,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:10:52,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:10:52,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:10:52,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:10:53,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:10:53,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:10:53,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:10:53,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:10:53,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:10:53,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:10:53,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:10:53,010 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:10:53,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:10:53,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:10:53,013 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:10:53,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:10:53,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:10:53,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:10:53,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:10:53,017 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:10:53,017 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:10:53,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:10:53,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:10:53,019 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-10 15:10:53,029 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:10:53,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:10:53,030 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:10:53,030 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:10:53,031 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:10:53,031 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:10:53,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:10:53,034 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:10:53,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:10:53,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:10:53,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:10:53,035 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:10:53,035 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:10:53,036 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:10:53,036 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:10:53,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:10:53,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:10:53,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:10:53,110 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:10:53,110 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:10:53,111 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_13.bpl [2018-10-10 15:10:53,111 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_13.bpl' [2018-10-10 15:10:53,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:10:53,186 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:10:53,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:10:53,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:10:53,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:10:53,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:10:53,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:10:53,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (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-10 15:10:53,336 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:10:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:10:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:10:53,922 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:10:53,923 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:53 BoogieIcfgContainer [2018-10-10 15:10:53,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:10:53,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:10:53,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:10:53,928 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:10:53,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/2) ... [2018-10-10 15:10:53,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2ed1b and model type 20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:10:53, skipping insertion in model container [2018-10-10 15:10:53,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:53" (2/2) ... [2018-10-10 15:10:53,931 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_13.bpl [2018-10-10 15:10:53,941 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:10:53,949 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:10:53,967 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:10:53,996 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:10:53,997 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:10:53,997 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:10:53,997 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:10:53,998 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:10:53,998 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:10:53,998 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:10:53,998 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:10:53,998 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:10:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-10 15:10:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 15:10:54,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,030 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, 1, 1, 1, 1, 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-10 15:10:54,032 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1864923847, now seen corresponding path program 1 times [2018-10-10 15:10:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:54,328 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-10 15:10:54,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:10:54,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:10:54,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:10:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:10:54,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:10:54,356 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2018-10-10 15:10:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:54,487 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-10 15:10:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:10:54,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-10-10 15:10:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:54,501 INFO L225 Difference]: With dead ends: 71 [2018-10-10 15:10:54,502 INFO L226 Difference]: Without dead ends: 71 [2018-10-10 15:10:54,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:10:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-10 15:10:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-10-10 15:10:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-10 15:10:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-10 15:10:54,552 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-10-10 15:10:54,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:54,553 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-10 15:10:54,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:10:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-10 15:10:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-10 15:10:54,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,556 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, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:54,556 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash -231181979, now seen corresponding path program 1 times [2018-10-10 15:10:54,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:54,739 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-10 15:10:54,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:54,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:10:54,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:10:54,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:10:54,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:10:54,743 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 5 states. [2018-10-10 15:10:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:54,896 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-10 15:10:54,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:10:54,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-10-10 15:10:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:54,899 INFO L225 Difference]: With dead ends: 74 [2018-10-10 15:10:54,899 INFO L226 Difference]: Without dead ends: 74 [2018-10-10 15:10:54,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-10 15:10:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-10 15:10:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-10 15:10:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-10 15:10:54,909 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-10-10 15:10:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:54,909 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-10 15:10:54,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:10:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-10 15:10:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 15:10:54,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,913 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:54,914 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash -790327801, now seen corresponding path program 2 times [2018-10-10 15:10:54,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:55,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:10:55,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:10:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:10:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,213 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 6 states. [2018-10-10 15:10:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,404 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-10 15:10:55,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:10:55,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-10-10 15:10:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,407 INFO L225 Difference]: With dead ends: 77 [2018-10-10 15:10:55,407 INFO L226 Difference]: Without dead ends: 77 [2018-10-10 15:10:55,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-10 15:10:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-10-10 15:10:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-10 15:10:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-10 15:10:55,416 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-10-10 15:10:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,416 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-10 15:10:55,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:10:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-10 15:10:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 15:10:55,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,419 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:55,419 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1874630181, now seen corresponding path program 3 times [2018-10-10 15:10:55,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:10:55,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:10:55,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:10:55,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:10:55,616 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 7 states. [2018-10-10 15:10:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,768 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-10 15:10:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:10:55,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-10-10 15:10:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,771 INFO L225 Difference]: With dead ends: 80 [2018-10-10 15:10:55,772 INFO L226 Difference]: Without dead ends: 80 [2018-10-10 15:10:55,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-10 15:10:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-10-10 15:10:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 15:10:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-10 15:10:55,780 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-10-10 15:10:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,780 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-10 15:10:55,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:10:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-10 15:10:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 15:10:55,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,782 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:55,782 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1167405383, now seen corresponding path program 4 times [2018-10-10 15:10:55,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:56,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:56,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:10:56,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:10:56,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:10:56,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:56,180 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 8 states. [2018-10-10 15:10:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:56,426 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-10 15:10:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:10:56,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2018-10-10 15:10:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:56,430 INFO L225 Difference]: With dead ends: 83 [2018-10-10 15:10:56,430 INFO L226 Difference]: Without dead ends: 83 [2018-10-10 15:10:56,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-10 15:10:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-10-10 15:10:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-10 15:10:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-10 15:10:56,437 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-10-10 15:10:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:56,438 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-10 15:10:56,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:10:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-10 15:10:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 15:10:56,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:56,440 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:56,441 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:56,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash -951964955, now seen corresponding path program 5 times [2018-10-10 15:10:56,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:56,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:56,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:10:56,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:10:56,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:10:56,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:10:56,867 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 9 states. [2018-10-10 15:10:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:57,061 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-10 15:10:57,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:10:57,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-10-10 15:10:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:57,063 INFO L225 Difference]: With dead ends: 86 [2018-10-10 15:10:57,064 INFO L226 Difference]: Without dead ends: 86 [2018-10-10 15:10:57,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:10:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-10 15:10:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-10-10 15:10:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-10 15:10:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-10 15:10:57,070 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-10-10 15:10:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:57,071 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-10 15:10:57,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:10:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-10 15:10:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 15:10:57,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:57,073 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:57,074 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:57,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1200514183, now seen corresponding path program 6 times [2018-10-10 15:10:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:57,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:10:57,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:10:57,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:10:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:57,276 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 10 states. [2018-10-10 15:10:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:57,510 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-10 15:10:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:10:57,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-10-10 15:10:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:57,517 INFO L225 Difference]: With dead ends: 89 [2018-10-10 15:10:57,518 INFO L226 Difference]: Without dead ends: 89 [2018-10-10 15:10:57,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:10:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-10 15:10:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-10-10 15:10:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-10 15:10:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-10 15:10:57,530 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-10-10 15:10:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:57,531 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-10 15:10:57,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:10:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-10 15:10:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 15:10:57,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:57,536 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:57,536 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:57,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1844785061, now seen corresponding path program 7 times [2018-10-10 15:10:57,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:57,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:10:57,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:10:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:10:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:10:57,856 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 11 states. [2018-10-10 15:10:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:58,036 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-10 15:10:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:10:58,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2018-10-10 15:10:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:58,039 INFO L225 Difference]: With dead ends: 92 [2018-10-10 15:10:58,039 INFO L226 Difference]: Without dead ends: 92 [2018-10-10 15:10:58,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:10:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-10 15:10:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-10-10 15:10:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-10 15:10:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-10 15:10:58,051 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-10-10 15:10:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:58,056 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-10 15:10:58,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:10:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-10 15:10:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 15:10:58,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:58,064 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:58,064 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:58,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:58,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1109665735, now seen corresponding path program 8 times [2018-10-10 15:10:58,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:58,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:10:58,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:10:58,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:10:58,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:58,719 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 12 states. [2018-10-10 15:10:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:59,072 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-10 15:10:59,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:10:59,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2018-10-10 15:10:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:59,075 INFO L225 Difference]: With dead ends: 95 [2018-10-10 15:10:59,075 INFO L226 Difference]: Without dead ends: 95 [2018-10-10 15:10:59,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:10:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-10 15:10:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-10-10 15:10:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-10 15:10:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-10 15:10:59,089 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-10-10 15:10:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:59,089 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-10 15:10:59,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:10:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-10 15:10:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-10 15:10:59,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:59,094 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:59,094 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:59,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:59,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1208067173, now seen corresponding path program 9 times [2018-10-10 15:10:59,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:59,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:10:59,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:10:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:10:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:10:59,426 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 13 states. [2018-10-10 15:10:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:59,662 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-10 15:10:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:10:59,669 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2018-10-10 15:10:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:59,670 INFO L225 Difference]: With dead ends: 98 [2018-10-10 15:10:59,670 INFO L226 Difference]: Without dead ends: 98 [2018-10-10 15:10:59,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:10:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-10 15:10:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-10-10 15:10:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-10 15:10:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-10 15:10:59,685 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-10-10 15:10:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:59,686 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-10 15:10:59,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:10:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-10 15:10:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 15:10:59,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:59,688 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:10:59,688 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:59,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash -777356537, now seen corresponding path program 10 times [2018-10-10 15:10:59,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:00,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:00,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:11:00,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:11:00,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:11:00,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:11:00,467 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 14 states. [2018-10-10 15:11:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:00,755 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-10 15:11:00,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:11:00,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-10-10 15:11:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:00,764 INFO L225 Difference]: With dead ends: 101 [2018-10-10 15:11:00,764 INFO L226 Difference]: Without dead ends: 101 [2018-10-10 15:11:00,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-10 15:11:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-10-10 15:11:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-10 15:11:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-10 15:11:00,768 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-10-10 15:11:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:00,769 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-10 15:11:00,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:11:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-10 15:11:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 15:11:00,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:00,770 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:00,771 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:00,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1754499365, now seen corresponding path program 11 times [2018-10-10 15:11:00,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:01,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:01,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:11:01,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:11:01,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:11:01,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:11:01,155 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 15 states. [2018-10-10 15:11:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:01,966 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-10 15:11:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:11:01,969 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2018-10-10 15:11:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:01,970 INFO L225 Difference]: With dead ends: 104 [2018-10-10 15:11:01,970 INFO L226 Difference]: Without dead ends: 104 [2018-10-10 15:11:01,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-10 15:11:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-10-10 15:11:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-10 15:11:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-10 15:11:01,974 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-10-10 15:11:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:01,974 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-10 15:11:01,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:11:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-10 15:11:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-10 15:11:01,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:01,976 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:01,976 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:01,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:01,976 INFO L82 PathProgramCache]: Analyzing trace with hash 58023495, now seen corresponding path program 12 times [2018-10-10 15:11:01,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:02,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:02,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:11:02,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:11:02,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:11:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:11:02,374 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 16 states. [2018-10-10 15:11:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:02,772 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-10 15:11:02,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:11:02,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 101 [2018-10-10 15:11:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:02,774 INFO L225 Difference]: With dead ends: 107 [2018-10-10 15:11:02,775 INFO L226 Difference]: Without dead ends: 107 [2018-10-10 15:11:02,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-10 15:11:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-10-10 15:11:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-10 15:11:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-10 15:11:02,780 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-10-10 15:11:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:02,780 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-10 15:11:02,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:11:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-10 15:11:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-10 15:11:02,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:02,782 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:02,782 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:02,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash -774447643, now seen corresponding path program 13 times [2018-10-10 15:11:02,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:03,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:03,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:11:03,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:11:03,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:11:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:11:03,030 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 17 states. [2018-10-10 15:11:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:03,390 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-10 15:11:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:11:03,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2018-10-10 15:11:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:03,391 INFO L225 Difference]: With dead ends: 110 [2018-10-10 15:11:03,391 INFO L226 Difference]: Without dead ends: 110 [2018-10-10 15:11:03,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-10 15:11:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-10-10 15:11:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-10 15:11:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-10 15:11:03,397 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-10-10 15:11:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:03,397 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-10 15:11:03,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:11:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-10 15:11:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 15:11:03,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:03,399 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:03,399 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:03,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1780952697, now seen corresponding path program 14 times [2018-10-10 15:11:03,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:03,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:03,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:11:03,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:11:03,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:11:03,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:11:03,626 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 18 states. [2018-10-10 15:11:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:04,205 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 15:11:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:11:04,206 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-10-10 15:11:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:04,207 INFO L225 Difference]: With dead ends: 113 [2018-10-10 15:11:04,207 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 15:11:04,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 15:11:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-10-10 15:11:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-10 15:11:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-10 15:11:04,211 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-10-10 15:11:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:04,212 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-10 15:11:04,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:11:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-10 15:11:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 15:11:04,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:04,213 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:04,213 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:04,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash 888644261, now seen corresponding path program 15 times [2018-10-10 15:11:04,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:04,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:04,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:11:04,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:11:04,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:11:04,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:11:04,498 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 19 states. [2018-10-10 15:11:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:04,852 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-10 15:11:04,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:11:04,853 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 110 [2018-10-10 15:11:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:04,854 INFO L225 Difference]: With dead ends: 116 [2018-10-10 15:11:04,854 INFO L226 Difference]: Without dead ends: 116 [2018-10-10 15:11:04,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-10 15:11:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-10 15:11:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 15:11:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-10 15:11:04,858 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-10-10 15:11:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:04,858 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-10 15:11:04,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:11:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-10 15:11:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 15:11:04,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:04,860 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:04,860 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:04,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:04,860 INFO L82 PathProgramCache]: Analyzing trace with hash 942200007, now seen corresponding path program 16 times [2018-10-10 15:11:04,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:05,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:05,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:11:05,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:11:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:11:05,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:11:05,167 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 20 states. [2018-10-10 15:11:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:05,594 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-10 15:11:05,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:11:05,594 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-10-10 15:11:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:05,595 INFO L225 Difference]: With dead ends: 119 [2018-10-10 15:11:05,595 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 15:11:05,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 15:11:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-10-10 15:11:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-10 15:11:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-10 15:11:05,599 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-10-10 15:11:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:05,599 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-10 15:11:05,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:11:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-10 15:11:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 15:11:05,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:05,601 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:05,601 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:05,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1306405019, now seen corresponding path program 17 times [2018-10-10 15:11:05,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:06,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:06,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:11:06,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:11:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:11:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:11:06,664 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 21 states. [2018-10-10 15:11:07,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:07,127 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-10 15:11:07,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:11:07,131 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 116 [2018-10-10 15:11:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:07,132 INFO L225 Difference]: With dead ends: 122 [2018-10-10 15:11:07,132 INFO L226 Difference]: Without dead ends: 122 [2018-10-10 15:11:07,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-10 15:11:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-10-10 15:11:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 15:11:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-10 15:11:07,136 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-10-10 15:11:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:07,136 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-10 15:11:07,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:11:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-10 15:11:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 15:11:07,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:07,137 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:07,137 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:07,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash -893818873, now seen corresponding path program 18 times [2018-10-10 15:11:07,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:07,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:07,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:11:07,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:11:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:11:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:11:07,949 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 22 states. [2018-10-10 15:11:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:08,466 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-10 15:11:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:11:08,466 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 119 [2018-10-10 15:11:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:08,467 INFO L225 Difference]: With dead ends: 125 [2018-10-10 15:11:08,467 INFO L226 Difference]: Without dead ends: 125 [2018-10-10 15:11:08,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-10 15:11:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-10 15:11:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 15:11:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-10 15:11:08,471 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-10-10 15:11:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:08,471 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-10 15:11:08,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:11:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-10 15:11:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 15:11:08,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:08,472 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:08,473 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:08,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1736344539, now seen corresponding path program 19 times [2018-10-10 15:11:08,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:09,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:09,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:11:09,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:11:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:11:09,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:11:09,278 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 23 states. [2018-10-10 15:11:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:09,747 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-10 15:11:09,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:11:09,748 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-10-10 15:11:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:09,749 INFO L225 Difference]: With dead ends: 128 [2018-10-10 15:11:09,749 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 15:11:09,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 15:11:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-10 15:11:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 15:11:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-10 15:11:09,753 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-10-10 15:11:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:09,753 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-10 15:11:09,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:11:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-10 15:11:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 15:11:09,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:09,755 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:09,755 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:09,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1629582521, now seen corresponding path program 20 times [2018-10-10 15:11:09,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:10,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:10,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:11:10,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:11:10,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:11:10,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:10,303 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 24 states. [2018-10-10 15:11:10,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:10,853 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-10 15:11:10,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:11:10,854 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 125 [2018-10-10 15:11:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:10,855 INFO L225 Difference]: With dead ends: 131 [2018-10-10 15:11:10,855 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 15:11:10,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 15:11:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-10-10 15:11:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-10 15:11:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-10 15:11:10,860 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-10-10 15:11:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:10,860 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-10 15:11:10,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:11:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-10 15:11:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 15:11:10,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:10,861 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:10,861 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:10,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash 641896677, now seen corresponding path program 21 times [2018-10-10 15:11:10,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:11,362 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-10 15:11:11,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:11,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:11:11,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:11:11,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:11:11,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:11:11,365 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 25 states. [2018-10-10 15:11:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:11,931 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-10 15:11:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:11:11,934 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 128 [2018-10-10 15:11:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:11,935 INFO L225 Difference]: With dead ends: 134 [2018-10-10 15:11:11,935 INFO L226 Difference]: Without dead ends: 134 [2018-10-10 15:11:11,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-10 15:11:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-10-10 15:11:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 15:11:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-10 15:11:11,939 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-10-10 15:11:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:11,939 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-10 15:11:11,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:11:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-10 15:11:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 15:11:11,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:11,941 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:11,941 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:11,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1226031481, now seen corresponding path program 22 times [2018-10-10 15:11:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:12,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:12,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:11:12,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:11:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:11:12,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:12,346 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 26 states. [2018-10-10 15:11:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:12,912 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-10 15:11:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:11:12,912 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 131 [2018-10-10 15:11:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:12,914 INFO L225 Difference]: With dead ends: 137 [2018-10-10 15:11:12,914 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 15:11:12,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:11:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 15:11:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-10 15:11:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 15:11:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-10 15:11:12,918 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-10-10 15:11:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:12,919 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-10 15:11:12,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:11:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-10 15:11:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 15:11:12,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:12,920 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:12,920 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:12,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:12,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1217467813, now seen corresponding path program 23 times [2018-10-10 15:11:12,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:13,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:13,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:11:13,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:11:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:11:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:11:13,393 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 27 states. [2018-10-10 15:11:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:14,084 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-10 15:11:14,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:11:14,090 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 134 [2018-10-10 15:11:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:14,091 INFO L225 Difference]: With dead ends: 140 [2018-10-10 15:11:14,091 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 15:11:14,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:11:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 15:11:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-10-10 15:11:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 15:11:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-10 15:11:14,095 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-10-10 15:11:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:14,095 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-10 15:11:14,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:11:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-10 15:11:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 15:11:14,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:14,097 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:14,097 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:14,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash 104235463, now seen corresponding path program 24 times [2018-10-10 15:11:14,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:14,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:14,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:11:14,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:11:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:11:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:14,609 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 28 states. [2018-10-10 15:11:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:15,222 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-10 15:11:15,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:11:15,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 137 [2018-10-10 15:11:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:15,223 INFO L225 Difference]: With dead ends: 143 [2018-10-10 15:11:15,224 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 15:11:15,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:11:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 15:11:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-10 15:11:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 15:11:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-10 15:11:15,228 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-10 15:11:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:15,228 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-10 15:11:15,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:11:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-10 15:11:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 15:11:15,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:15,229 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:15,229 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:15,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:15,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1536756325, now seen corresponding path program 25 times [2018-10-10 15:11:15,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:16,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:16,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:11:16,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:11:16,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:11:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:11:16,439 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 29 states. [2018-10-10 15:11:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:17,125 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-10 15:11:17,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:11:17,126 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 140 [2018-10-10 15:11:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:17,127 INFO L225 Difference]: With dead ends: 146 [2018-10-10 15:11:17,127 INFO L226 Difference]: Without dead ends: 146 [2018-10-10 15:11:17,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:11:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-10 15:11:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-10 15:11:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 15:11:17,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-10 15:11:17,132 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-10 15:11:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:17,133 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-10 15:11:17,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:11:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-10 15:11:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 15:11:17,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:17,134 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:17,134 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:17,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1324264185, now seen corresponding path program 26 times [2018-10-10 15:11:17,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:17,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:17,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:11:17,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:11:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:11:17,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:17,707 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 30 states. [2018-10-10 15:11:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:18,443 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 15:11:18,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:11:18,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 143 [2018-10-10 15:11:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:18,444 INFO L225 Difference]: With dead ends: 149 [2018-10-10 15:11:18,444 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 15:11:18,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:11:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 15:11:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-10 15:11:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-10 15:11:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-10 15:11:18,448 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-10 15:11:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:18,449 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-10 15:11:18,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:11:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-10 15:11:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-10 15:11:18,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:18,450 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:18,450 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:18,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash -360288475, now seen corresponding path program 27 times [2018-10-10 15:11:18,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:19,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:19,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:11:19,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:11:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:11:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:11:19,598 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 31 states. [2018-10-10 15:11:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:20,352 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-10 15:11:20,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:11:20,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 146 [2018-10-10 15:11:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:20,354 INFO L225 Difference]: With dead ends: 152 [2018-10-10 15:11:20,354 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 15:11:20,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:11:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 15:11:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-10 15:11:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 15:11:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 15:11:20,358 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-10 15:11:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:20,358 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 15:11:20,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:11:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 15:11:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:11:20,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:20,359 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:20,360 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:20,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1288747079, now seen corresponding path program 28 times [2018-10-10 15:11:20,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:20,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:20,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:11:20,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:11:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:11:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:20,952 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 32 states. [2018-10-10 15:11:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:22,017 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-10 15:11:22,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:11:22,017 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 149 [2018-10-10 15:11:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:22,018 INFO L225 Difference]: With dead ends: 155 [2018-10-10 15:11:22,018 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 15:11:22,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:11:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 15:11:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-10 15:11:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-10 15:11:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-10 15:11:22,023 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-10-10 15:11:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:22,024 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-10 15:11:22,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:11:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-10 15:11:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-10 15:11:22,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:22,025 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:22,025 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:22,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1871004645, now seen corresponding path program 29 times [2018-10-10 15:11:22,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:22,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:22,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:11:22,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:11:22,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:11:22,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:11:22,694 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 33 states. [2018-10-10 15:11:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:23,607 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-10 15:11:23,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:11:23,607 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-10-10 15:11:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:23,608 INFO L225 Difference]: With dead ends: 158 [2018-10-10 15:11:23,608 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 15:11:23,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:11:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 15:11:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-10-10 15:11:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 15:11:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-10 15:11:23,613 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-10-10 15:11:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:23,613 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-10 15:11:23,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:11:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-10 15:11:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 15:11:23,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:23,614 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:23,614 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:23,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:23,615 INFO L82 PathProgramCache]: Analyzing trace with hash 533244807, now seen corresponding path program 30 times [2018-10-10 15:11:23,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:26,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:26,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:11:26,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:11:26,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:11:26,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:26,005 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 34 states. [2018-10-10 15:11:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:26,872 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-10 15:11:26,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:11:26,872 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 155 [2018-10-10 15:11:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:26,873 INFO L225 Difference]: With dead ends: 161 [2018-10-10 15:11:26,873 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 15:11:26,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:11:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 15:11:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-10-10 15:11:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-10 15:11:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-10 15:11:26,877 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-10 15:11:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:26,877 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-10 15:11:26,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:11:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-10 15:11:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-10 15:11:26,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:26,879 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:26,879 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:26,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:26,879 INFO L82 PathProgramCache]: Analyzing trace with hash 331450533, now seen corresponding path program 31 times [2018-10-10 15:11:26,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:28,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:28,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:11:28,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:11:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:11:28,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:11:28,545 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 35 states. [2018-10-10 15:11:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:29,812 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-10 15:11:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:11:29,812 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 158 [2018-10-10 15:11:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:29,813 INFO L225 Difference]: With dead ends: 164 [2018-10-10 15:11:29,813 INFO L226 Difference]: Without dead ends: 164 [2018-10-10 15:11:29,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:11:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-10 15:11:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-10-10 15:11:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 15:11:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-10 15:11:29,819 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-10 15:11:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:29,819 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-10 15:11:29,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:11:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-10 15:11:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-10 15:11:29,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:29,821 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:29,821 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:29,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1632448199, now seen corresponding path program 32 times [2018-10-10 15:11:29,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:30,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:30,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:11:30,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:11:30,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:11:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:30,702 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 36 states. [2018-10-10 15:11:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:31,719 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-10 15:11:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:11:31,719 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 161 [2018-10-10 15:11:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:31,720 INFO L225 Difference]: With dead ends: 167 [2018-10-10 15:11:31,720 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 15:11:31,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:11:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 15:11:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-10 15:11:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:11:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-10 15:11:31,725 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-10 15:11:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:31,725 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-10 15:11:31,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:11:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-10 15:11:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 15:11:31,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:31,726 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:31,727 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:31,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1869036901, now seen corresponding path program 33 times [2018-10-10 15:11:31,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:32,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:32,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:11:32,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:11:32,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:11:32,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:11:32,400 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 37 states. [2018-10-10 15:11:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:33,374 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-10 15:11:33,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:11:33,375 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 164 [2018-10-10 15:11:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:33,376 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:11:33,376 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:11:33,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:11:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:11:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-10 15:11:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 15:11:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-10 15:11:33,380 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-10 15:11:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:33,380 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-10 15:11:33,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:11:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-10 15:11:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 15:11:33,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:33,381 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:33,381 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:33,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:33,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2041725447, now seen corresponding path program 34 times [2018-10-10 15:11:33,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:34,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:34,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:11:34,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:11:34,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:11:34,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:34,149 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 38 states. [2018-10-10 15:11:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:35,337 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-10 15:11:35,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:11:35,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 167 [2018-10-10 15:11:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:35,338 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:11:35,338 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:11:35,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:11:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:11:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-10 15:11:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:11:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 15:11:35,344 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-10 15:11:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:35,344 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 15:11:35,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:11:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 15:11:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:11:35,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:35,345 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:35,346 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:35,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1235378725, now seen corresponding path program 35 times [2018-10-10 15:11:35,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:11:36,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:11:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:11:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:11:36,296 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 39 states. [2018-10-10 15:11:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:38,646 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-10 15:11:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:11:38,646 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 170 [2018-10-10 15:11:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:38,647 INFO L225 Difference]: With dead ends: 176 [2018-10-10 15:11:38,647 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 15:11:38,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:11:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 15:11:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-10-10 15:11:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 15:11:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-10 15:11:38,652 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-10 15:11:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:38,652 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-10 15:11:38,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:11:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-10 15:11:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 15:11:38,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:38,653 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:38,653 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:38,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1112270151, now seen corresponding path program 36 times [2018-10-10 15:11:38,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:39,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:39,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:11:39,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:11:39,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:11:39,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:39,971 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 40 states. [2018-10-10 15:11:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:41,087 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-10 15:11:41,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:11:41,087 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 173 [2018-10-10 15:11:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:41,088 INFO L225 Difference]: With dead ends: 179 [2018-10-10 15:11:41,088 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 15:11:41,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:11:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 15:11:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-10 15:11:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 15:11:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-10 15:11:41,092 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-10 15:11:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:41,093 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-10 15:11:41,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:11:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-10 15:11:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-10 15:11:41,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:41,094 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:41,094 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:41,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:41,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1486812901, now seen corresponding path program 37 times [2018-10-10 15:11:41,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:42,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:42,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:11:42,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:11:42,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:11:42,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:11:42,046 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 41 states. [2018-10-10 15:11:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:43,317 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-10 15:11:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:11:43,317 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 176 [2018-10-10 15:11:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:43,318 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:11:43,318 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:11:43,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:11:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:11:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-10 15:11:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 15:11:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-10 15:11:43,321 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-10 15:11:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:43,321 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-10 15:11:43,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:11:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-10 15:11:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 15:11:43,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:43,322 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:43,323 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:43,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:43,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1164843143, now seen corresponding path program 38 times [2018-10-10 15:11:43,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:44,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:44,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:11:44,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:11:44,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:11:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:44,177 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 42 states. [2018-10-10 15:11:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:45,719 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-10 15:11:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:11:45,720 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 179 [2018-10-10 15:11:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:45,721 INFO L225 Difference]: With dead ends: 185 [2018-10-10 15:11:45,721 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 15:11:45,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:11:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 15:11:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-10 15:11:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 15:11:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-10 15:11:45,725 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-10 15:11:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:45,726 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-10 15:11:45,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:11:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-10 15:11:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 15:11:45,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:45,727 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:45,727 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:45,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:45,727 INFO L82 PathProgramCache]: Analyzing trace with hash 25754533, now seen corresponding path program 39 times [2018-10-10 15:11:45,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:46,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:46,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:11:46,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:11:46,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:11:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:11:46,605 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 43 states. [2018-10-10 15:11:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:47,870 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-10 15:11:47,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:11:47,871 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 182 [2018-10-10 15:11:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:47,872 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:11:47,872 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:11:47,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:11:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:11:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-10 15:11:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:11:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-10 15:11:47,876 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-10 15:11:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:47,876 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-10 15:11:47,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:11:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-10 15:11:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:11:47,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:47,877 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:47,878 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:47,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash -26420281, now seen corresponding path program 40 times [2018-10-10 15:11:47,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:48,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:48,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:11:48,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:11:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:11:48,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:48,844 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 44 states. [2018-10-10 15:11:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:50,400 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 15:11:50,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:11:50,404 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 185 [2018-10-10 15:11:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:50,405 INFO L225 Difference]: With dead ends: 191 [2018-10-10 15:11:50,405 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 15:11:50,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:11:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 15:11:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-10 15:11:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 15:11:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-10 15:11:50,408 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-10 15:11:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:50,408 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-10 15:11:50,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:11:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-10 15:11:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-10 15:11:50,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:50,409 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:50,409 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:50,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash 411856997, now seen corresponding path program 41 times [2018-10-10 15:11:50,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:51,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:51,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:11:51,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:11:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:11:51,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:11:51,425 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 45 states. [2018-10-10 15:11:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:52,971 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-10 15:11:52,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:11:52,972 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 188 [2018-10-10 15:11:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:52,972 INFO L225 Difference]: With dead ends: 194 [2018-10-10 15:11:52,972 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 15:11:52,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:11:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 15:11:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-10-10 15:11:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:11:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 15:11:52,976 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-10 15:11:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:52,976 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 15:11:52,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:11:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 15:11:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 15:11:52,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:52,978 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:52,978 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:52,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash 429666055, now seen corresponding path program 42 times [2018-10-10 15:11:52,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:54,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:11:54,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:11:54,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:11:54,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:54,137 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 46 states. [2018-10-10 15:11:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:55,945 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 15:11:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:11:55,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 191 [2018-10-10 15:11:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:55,946 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:11:55,946 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:11:55,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:11:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:11:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-10 15:11:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 15:11:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-10 15:11:55,950 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-10 15:11:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:55,951 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-10 15:11:55,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:11:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-10 15:11:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-10 15:11:55,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:55,952 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:55,952 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:55,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1596631771, now seen corresponding path program 43 times [2018-10-10 15:11:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:57,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:57,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:11:57,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:11:57,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:11:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:11:57,033 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 47 states. [2018-10-10 15:11:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:58,560 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-10 15:11:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:11:58,561 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 194 [2018-10-10 15:11:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:58,561 INFO L225 Difference]: With dead ends: 200 [2018-10-10 15:11:58,561 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 15:11:58,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:11:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 15:11:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-10 15:11:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 15:11:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-10 15:11:58,564 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-10 15:11:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:58,564 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-10 15:11:58,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:11:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-10 15:11:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 15:11:58,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:58,565 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:11:58,566 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:58,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1269820857, now seen corresponding path program 44 times [2018-10-10 15:11:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:11:59,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:11:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:11:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:11:59,737 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 48 states. [2018-10-10 15:12:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:01,487 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-10 15:12:01,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:12:01,487 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 197 [2018-10-10 15:12:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:01,488 INFO L225 Difference]: With dead ends: 203 [2018-10-10 15:12:01,488 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 15:12:01,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:12:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 15:12:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-10-10 15:12:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 15:12:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-10 15:12:01,491 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-10 15:12:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:01,491 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-10 15:12:01,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:12:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-10 15:12:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 15:12:01,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:01,492 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:01,492 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:01,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1936741915, now seen corresponding path program 45 times [2018-10-10 15:12:01,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:02,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:02,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:12:02,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:12:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:12:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:12:02,744 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 49 states. [2018-10-10 15:12:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:04,295 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-10 15:12:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:12:04,296 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 200 [2018-10-10 15:12:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:04,297 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:12:04,297 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:12:04,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:12:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:12:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-10 15:12:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:12:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-10 15:12:04,300 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-10 15:12:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:04,301 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-10 15:12:04,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:12:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-10 15:12:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-10 15:12:04,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:04,302 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:04,302 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:04,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1663269497, now seen corresponding path program 46 times [2018-10-10 15:12:04,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:05,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:05,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:12:05,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:12:05,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:12:05,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:12:05,732 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 50 states. [2018-10-10 15:12:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:07,444 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-10 15:12:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:12:07,444 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 203 [2018-10-10 15:12:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:07,445 INFO L225 Difference]: With dead ends: 209 [2018-10-10 15:12:07,445 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 15:12:07,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:12:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 15:12:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-10 15:12:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 15:12:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-10 15:12:07,448 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-10 15:12:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:07,448 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-10 15:12:07,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:12:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-10 15:12:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 15:12:07,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:07,449 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:07,449 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:07,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:07,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2095541925, now seen corresponding path program 47 times [2018-10-10 15:12:07,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:09,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:09,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:12:09,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:12:09,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:12:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:12:09,019 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 51 states. [2018-10-10 15:12:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:11,020 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-10 15:12:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:12:11,020 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 206 [2018-10-10 15:12:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:11,021 INFO L225 Difference]: With dead ends: 212 [2018-10-10 15:12:11,021 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 15:12:11,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:12:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 15:12:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-10 15:12:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 15:12:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-10 15:12:11,028 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-10 15:12:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:11,028 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-10 15:12:11,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:12:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-10 15:12:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-10 15:12:11,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:11,030 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:11,030 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:11,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1835693881, now seen corresponding path program 48 times [2018-10-10 15:12:11,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:12,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:12,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:12:12,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:12:12,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:12:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:12:12,255 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 52 states. [2018-10-10 15:12:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:14,065 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-10 15:12:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:12:14,065 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 209 [2018-10-10 15:12:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:14,066 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:12:14,066 INFO L226 Difference]: Without dead ends: 215 [2018-10-10 15:12:14,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:12:14,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-10 15:12:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-10 15:12:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:12:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-10 15:12:14,070 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-10 15:12:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:14,070 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-10 15:12:14,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:12:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-10 15:12:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-10 15:12:14,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:14,071 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:14,071 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:14,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363099, now seen corresponding path program 49 times [2018-10-10 15:12:14,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:15,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:15,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:12:15,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:12:15,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:12:15,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:12:15,360 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 53 states. [2018-10-10 15:12:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:17,451 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-10 15:12:17,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:12:17,451 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 212 [2018-10-10 15:12:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:17,452 INFO L225 Difference]: With dead ends: 218 [2018-10-10 15:12:17,452 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:12:17,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:12:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:12:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-10-10 15:12:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:12:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-10 15:12:17,456 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-10 15:12:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:17,457 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-10 15:12:17,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:12:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-10 15:12:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-10 15:12:17,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:17,458 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:17,458 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:17,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2050024441, now seen corresponding path program 50 times [2018-10-10 15:12:17,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:18,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:18,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:12:18,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:12:18,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:12:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:12:18,901 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 54 states. [2018-10-10 15:12:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:21,073 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-10 15:12:21,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:12:21,074 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 215 [2018-10-10 15:12:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:21,075 INFO L225 Difference]: With dead ends: 221 [2018-10-10 15:12:21,075 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 15:12:21,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 15:12:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 15:12:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-10 15:12:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 15:12:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-10 15:12:21,078 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-10 15:12:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:21,078 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-10 15:12:21,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:12:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-10 15:12:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-10 15:12:21,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:21,080 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:21,080 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:21,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash -618706907, now seen corresponding path program 51 times [2018-10-10 15:12:21,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:22,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:22,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:12:22,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:12:22,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:12:22,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:12:22,474 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 55 states. [2018-10-10 15:12:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:24,351 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-10 15:12:24,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:12:24,351 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 218 [2018-10-10 15:12:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:24,353 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:12:24,353 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:12:24,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 15:12:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:12:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-10 15:12:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-10 15:12:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-10 15:12:24,357 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-10 15:12:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:24,357 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-10 15:12:24,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:12:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-10 15:12:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-10 15:12:24,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:24,358 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:24,358 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:24,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash -673366201, now seen corresponding path program 52 times [2018-10-10 15:12:24,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:25,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:12:25,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:12:25,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:12:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:12:25,886 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 56 states. [2018-10-10 15:12:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:28,061 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-10 15:12:28,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:12:28,061 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 221 [2018-10-10 15:12:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:28,063 INFO L225 Difference]: With dead ends: 227 [2018-10-10 15:12:28,063 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 15:12:28,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 15:12:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 15:12:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-10 15:12:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-10 15:12:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-10 15:12:28,067 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-10 15:12:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:28,068 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-10 15:12:28,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:12:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-10 15:12:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-10 15:12:28,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:28,069 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:28,069 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:28,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1235788571, now seen corresponding path program 53 times [2018-10-10 15:12:28,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:29,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:29,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:12:29,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:12:29,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:12:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:12:29,538 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 57 states. [2018-10-10 15:12:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:31,882 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-10 15:12:31,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:12:31,883 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 224 [2018-10-10 15:12:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:31,884 INFO L225 Difference]: With dead ends: 230 [2018-10-10 15:12:31,884 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 15:12:31,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 15:12:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 15:12:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-10 15:12:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 15:12:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-10 15:12:31,887 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-10 15:12:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:31,887 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-10 15:12:31,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:12:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-10 15:12:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-10 15:12:31,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:31,888 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:31,888 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:31,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1693191545, now seen corresponding path program 54 times [2018-10-10 15:12:31,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:33,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:33,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:12:33,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:12:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:12:33,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:12:33,447 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 58 states. [2018-10-10 15:12:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:35,617 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-10 15:12:35,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:12:35,618 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 227 [2018-10-10 15:12:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:35,619 INFO L225 Difference]: With dead ends: 233 [2018-10-10 15:12:35,619 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 15:12:35,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:12:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 15:12:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-10 15:12:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:12:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-10 15:12:35,621 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-10 15:12:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:35,622 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-10 15:12:35,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:12:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-10 15:12:35,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:12:35,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:35,623 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:35,623 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:35,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash -253959771, now seen corresponding path program 55 times [2018-10-10 15:12:35,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:37,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:37,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:12:37,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:12:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:12:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:12:37,447 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 59 states. [2018-10-10 15:12:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:39,693 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-10 15:12:39,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:12:39,693 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-10-10 15:12:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:39,694 INFO L225 Difference]: With dead ends: 236 [2018-10-10 15:12:39,694 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 15:12:39,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 15:12:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 15:12:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-10 15:12:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 15:12:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-10 15:12:39,698 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-10 15:12:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:39,698 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-10 15:12:39,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:12:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-10 15:12:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-10 15:12:39,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:39,699 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:39,699 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:39,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash -758696505, now seen corresponding path program 56 times [2018-10-10 15:12:39,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:41,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:41,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:12:41,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:12:41,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:12:41,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:12:41,552 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 60 states. [2018-10-10 15:12:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:43,915 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-10 15:12:43,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:12:43,915 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 233 [2018-10-10 15:12:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:43,916 INFO L225 Difference]: With dead ends: 239 [2018-10-10 15:12:43,916 INFO L226 Difference]: Without dead ends: 239 [2018-10-10 15:12:43,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 15:12:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-10 15:12:43,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-10 15:12:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 15:12:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-10 15:12:43,920 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-10 15:12:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:43,920 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-10 15:12:43,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:12:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-10 15:12:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-10 15:12:43,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:43,922 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:43,922 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:43,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash -690235803, now seen corresponding path program 57 times [2018-10-10 15:12:43,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:45,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:45,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:12:45,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:12:45,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:12:45,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:12:45,848 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 61 states. [2018-10-10 15:12:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:48,548 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-10 15:12:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:12:48,548 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2018-10-10 15:12:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:48,549 INFO L225 Difference]: With dead ends: 242 [2018-10-10 15:12:48,549 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 15:12:48,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 15:12:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 15:12:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-10 15:12:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 15:12:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-10 15:12:48,554 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-10 15:12:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:48,554 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-10 15:12:48,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:12:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-10 15:12:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-10 15:12:48,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:48,556 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:48,556 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:48,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1286928121, now seen corresponding path program 58 times [2018-10-10 15:12:48,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:50,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:50,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:12:50,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:12:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:12:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:12:50,196 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 62 states. [2018-10-10 15:12:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:52,907 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-10 15:12:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:12:52,907 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 239 [2018-10-10 15:12:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:52,908 INFO L225 Difference]: With dead ends: 245 [2018-10-10 15:12:52,908 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 15:12:52,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 15:12:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 15:12:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-10 15:12:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-10 15:12:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-10 15:12:52,912 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-10 15:12:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:52,912 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-10 15:12:52,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:12:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-10 15:12:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-10 15:12:52,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:52,914 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:52,914 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:52,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash -478135515, now seen corresponding path program 59 times [2018-10-10 15:12:52,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:54,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:54,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:12:54,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:12:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:12:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:12:54,663 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 63 states. [2018-10-10 15:12:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:57,523 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-10 15:12:57,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:12:57,524 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 242 [2018-10-10 15:12:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:57,525 INFO L225 Difference]: With dead ends: 248 [2018-10-10 15:12:57,525 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 15:12:57,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:12:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 15:12:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-10 15:12:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-10 15:12:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-10 15:12:57,528 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-10 15:12:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:57,528 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-10 15:12:57,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:12:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-10 15:12:57,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-10 15:12:57,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:57,529 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:12:57,529 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:57,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash -504140729, now seen corresponding path program 60 times [2018-10-10 15:12:57,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:59,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:59,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:12:59,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:12:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:12:59,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:12:59,238 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 64 states. [2018-10-10 15:13:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:01,797 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-10 15:13:01,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:13:01,798 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 245 [2018-10-10 15:13:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:01,799 INFO L225 Difference]: With dead ends: 251 [2018-10-10 15:13:01,799 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 15:13:01,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:13:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 15:13:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-10 15:13:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 15:13:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-10 15:13:01,803 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-10 15:13:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:01,804 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-10 15:13:01,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:13:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-10 15:13:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-10 15:13:01,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:01,805 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:01,805 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:01,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:01,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2131357723, now seen corresponding path program 61 times [2018-10-10 15:13:01,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:03,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:03,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:13:03,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:13:03,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:13:03,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:13:03,596 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 65 states. [2018-10-10 15:13:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:06,261 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-10 15:13:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:13:06,262 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 248 [2018-10-10 15:13:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:06,263 INFO L225 Difference]: With dead ends: 254 [2018-10-10 15:13:06,263 INFO L226 Difference]: Without dead ends: 254 [2018-10-10 15:13:06,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-10 15:13:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-10 15:13:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-10-10 15:13:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 15:13:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-10 15:13:06,266 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-10 15:13:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:06,267 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-10 15:13:06,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:13:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-10 15:13:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-10 15:13:06,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:06,268 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:06,269 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:06,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1256956025, now seen corresponding path program 62 times [2018-10-10 15:13:06,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:08,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:08,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:13:08,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:13:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:13:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:13:08,186 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 66 states. [2018-10-10 15:13:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:10,964 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-10 15:13:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:13:10,964 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 251 [2018-10-10 15:13:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:10,965 INFO L225 Difference]: With dead ends: 257 [2018-10-10 15:13:10,965 INFO L226 Difference]: Without dead ends: 257 [2018-10-10 15:13:10,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 15:13:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-10 15:13:10,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-10 15:13:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:13:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 15:13:10,968 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-10 15:13:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:10,969 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 15:13:10,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:13:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 15:13:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 15:13:10,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:10,970 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:10,970 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:10,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash -932621147, now seen corresponding path program 63 times [2018-10-10 15:13:10,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:13,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:13,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:13:13,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:13:13,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:13:13,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:13:13,188 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 67 states. [2018-10-10 15:13:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:15,966 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-10 15:13:15,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:13:15,967 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 254 [2018-10-10 15:13:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:15,968 INFO L225 Difference]: With dead ends: 260 [2018-10-10 15:13:15,968 INFO L226 Difference]: Without dead ends: 260 [2018-10-10 15:13:15,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 15:13:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-10 15:13:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-10-10 15:13:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-10 15:13:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-10-10 15:13:15,971 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 254 [2018-10-10 15:13:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:15,972 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-10-10 15:13:15,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:13:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-10-10 15:13:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-10 15:13:15,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:15,973 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:15,973 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:15,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:15,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1946280647, now seen corresponding path program 64 times [2018-10-10 15:13:15,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:18,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:18,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:13:18,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:13:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:13:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:13:18,236 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 68 states. [2018-10-10 15:13:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:21,205 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-10 15:13:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 15:13:21,206 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 257 [2018-10-10 15:13:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:21,207 INFO L225 Difference]: With dead ends: 263 [2018-10-10 15:13:21,207 INFO L226 Difference]: Without dead ends: 263 [2018-10-10 15:13:21,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:13:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-10 15:13:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2018-10-10 15:13:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-10 15:13:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-10 15:13:21,210 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 257 [2018-10-10 15:13:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:21,211 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-10 15:13:21,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:13:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-10 15:13:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-10 15:13:21,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:21,212 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:21,213 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:21,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:21,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1107691877, now seen corresponding path program 65 times [2018-10-10 15:13:21,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:23,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:23,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:13:23,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:13:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:13:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:13:23,405 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 69 states. [2018-10-10 15:13:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:26,480 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-10 15:13:26,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:13:26,480 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 260 [2018-10-10 15:13:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:26,481 INFO L225 Difference]: With dead ends: 266 [2018-10-10 15:13:26,481 INFO L226 Difference]: Without dead ends: 266 [2018-10-10 15:13:26,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 15:13:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-10 15:13:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-10-10 15:13:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 15:13:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-10 15:13:26,484 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 260 [2018-10-10 15:13:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:26,484 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-10 15:13:26,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:13:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-10 15:13:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-10 15:13:26,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:26,486 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:26,486 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:26,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1760561657, now seen corresponding path program 66 times [2018-10-10 15:13:26,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:28,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:28,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 15:13:28,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 15:13:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 15:13:28,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:13:28,875 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 70 states. [2018-10-10 15:13:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:31,878 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-10 15:13:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:13:31,878 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 263 [2018-10-10 15:13:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:31,879 INFO L225 Difference]: With dead ends: 269 [2018-10-10 15:13:31,879 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 15:13:31,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 15:13:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 15:13:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2018-10-10 15:13:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-10 15:13:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-10 15:13:31,884 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 263 [2018-10-10 15:13:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:31,884 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-10 15:13:31,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 15:13:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-10 15:13:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-10 15:13:31,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:31,885 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:31,885 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:31,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:31,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1527239131, now seen corresponding path program 67 times [2018-10-10 15:13:31,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:34,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:34,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:13:34,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:13:34,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:13:34,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:13:34,229 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 71 states. [2018-10-10 15:13:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:37,448 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-10 15:13:37,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 15:13:37,448 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 266 [2018-10-10 15:13:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:37,449 INFO L225 Difference]: With dead ends: 272 [2018-10-10 15:13:37,449 INFO L226 Difference]: Without dead ends: 272 [2018-10-10 15:13:37,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 15:13:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-10 15:13:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-10-10 15:13:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-10 15:13:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-10 15:13:37,452 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 266 [2018-10-10 15:13:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:37,453 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-10 15:13:37,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:13:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-10 15:13:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-10 15:13:37,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:37,462 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:37,462 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:37,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash 127048007, now seen corresponding path program 68 times [2018-10-10 15:13:37,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:39,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:39,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 15:13:39,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 15:13:39,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 15:13:39,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:13:39,889 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 72 states. [2018-10-10 15:13:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:43,413 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-10 15:13:43,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:13:43,414 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 269 [2018-10-10 15:13:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:43,415 INFO L225 Difference]: With dead ends: 275 [2018-10-10 15:13:43,415 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 15:13:43,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:13:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 15:13:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-10-10 15:13:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-10 15:13:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-10 15:13:43,418 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 269 [2018-10-10 15:13:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:43,418 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-10 15:13:43,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 15:13:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-10 15:13:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-10 15:13:43,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:43,419 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:43,419 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:43,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:43,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1754545435, now seen corresponding path program 69 times [2018-10-10 15:13:43,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:45,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:45,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:13:45,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:13:45,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:13:45,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:13:45,721 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 73 states. [2018-10-10 15:13:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:49,345 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-10 15:13:49,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:13:49,345 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 272 [2018-10-10 15:13:49,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:49,346 INFO L225 Difference]: With dead ends: 278 [2018-10-10 15:13:49,347 INFO L226 Difference]: Without dead ends: 278 [2018-10-10 15:13:49,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:13:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-10 15:13:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-10-10 15:13:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 15:13:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-10 15:13:49,350 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 272 [2018-10-10 15:13:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:49,350 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-10 15:13:49,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:13:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-10 15:13:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-10 15:13:49,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:49,351 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:49,351 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:49,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:49,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1608371335, now seen corresponding path program 70 times [2018-10-10 15:13:49,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:51,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:51,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 15:13:51,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 15:13:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 15:13:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:13:51,683 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 74 states. [2018-10-10 15:13:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:55,388 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-10 15:13:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:13:55,389 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 275 [2018-10-10 15:13:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:55,390 INFO L225 Difference]: With dead ends: 281 [2018-10-10 15:13:55,390 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 15:13:55,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 15:13:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 15:13:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2018-10-10 15:13:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 15:13:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-10 15:13:55,393 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 275 [2018-10-10 15:13:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:55,393 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-10 15:13:55,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 15:13:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-10 15:13:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-10 15:13:55,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:55,394 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:13:55,394 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:55,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1854719909, now seen corresponding path program 71 times [2018-10-10 15:13:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:57,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:57,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:13:57,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:13:57,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:13:57,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:13:57,767 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 75 states. [2018-10-10 15:14:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:01,685 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-10 15:14:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:14:01,685 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 278 [2018-10-10 15:14:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:01,686 INFO L225 Difference]: With dead ends: 284 [2018-10-10 15:14:01,686 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 15:14:01,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 15:14:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 15:14:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2018-10-10 15:14:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 15:14:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-10 15:14:01,690 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 278 [2018-10-10 15:14:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:01,690 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-10 15:14:01,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:14:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-10 15:14:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-10 15:14:01,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:01,691 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:01,691 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:01,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:01,692 INFO L82 PathProgramCache]: Analyzing trace with hash 725979079, now seen corresponding path program 72 times [2018-10-10 15:14:01,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:04,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:04,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 15:14:04,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 15:14:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 15:14:04,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:14:04,696 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 76 states. [2018-10-10 15:14:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:08,644 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-10 15:14:08,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:14:08,644 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 281 [2018-10-10 15:14:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:08,645 INFO L225 Difference]: With dead ends: 287 [2018-10-10 15:14:08,645 INFO L226 Difference]: Without dead ends: 287 [2018-10-10 15:14:08,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 15:14:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-10 15:14:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-10-10 15:14:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 15:14:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-10 15:14:08,648 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 281 [2018-10-10 15:14:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:08,648 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-10 15:14:08,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 15:14:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-10 15:14:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-10 15:14:08,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:08,650 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:08,650 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:08,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash -293127067, now seen corresponding path program 73 times [2018-10-10 15:14:08,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:11,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:11,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:14:11,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:14:11,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:14:11,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:14:11,128 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 77 states. [2018-10-10 15:14:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:14,766 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-10 15:14:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:14:14,766 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 284 [2018-10-10 15:14:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:14,767 INFO L225 Difference]: With dead ends: 290 [2018-10-10 15:14:14,767 INFO L226 Difference]: Without dead ends: 290 [2018-10-10 15:14:14,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:14:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-10 15:14:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-10 15:14:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-10 15:14:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-10-10 15:14:14,771 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 284 [2018-10-10 15:14:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:14,771 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-10-10 15:14:14,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:14:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-10-10 15:14:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-10 15:14:14,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:14,772 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:14,772 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:14,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash 639492871, now seen corresponding path program 74 times [2018-10-10 15:14:14,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:17,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:17,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 15:14:17,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 15:14:17,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 15:14:17,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:14:17,237 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 78 states. [2018-10-10 15:14:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:21,191 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-10 15:14:21,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:14:21,191 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 287 [2018-10-10 15:14:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:21,192 INFO L225 Difference]: With dead ends: 293 [2018-10-10 15:14:21,193 INFO L226 Difference]: Without dead ends: 293 [2018-10-10 15:14:21,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:14:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-10 15:14:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-10-10 15:14:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-10 15:14:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-10 15:14:21,196 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 287 [2018-10-10 15:14:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:21,196 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-10 15:14:21,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 15:14:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-10 15:14:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-10 15:14:21,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:21,197 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:21,197 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:21,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:21,198 INFO L82 PathProgramCache]: Analyzing trace with hash 176628005, now seen corresponding path program 75 times [2018-10-10 15:14:21,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:24,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:24,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:14:24,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:14:24,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:14:24,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:14:24,140 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 79 states. [2018-10-10 15:14:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:28,088 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-10 15:14:28,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:14:28,088 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 290 [2018-10-10 15:14:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:28,089 INFO L225 Difference]: With dead ends: 296 [2018-10-10 15:14:28,089 INFO L226 Difference]: Without dead ends: 296 [2018-10-10 15:14:28,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 15:14:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-10 15:14:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-10 15:14:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-10 15:14:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 294 transitions. [2018-10-10 15:14:28,092 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 294 transitions. Word has length 290 [2018-10-10 15:14:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:28,092 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 294 transitions. [2018-10-10 15:14:28,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:14:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 294 transitions. [2018-10-10 15:14:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-10 15:14:28,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:28,093 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:28,094 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:28,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2109392455, now seen corresponding path program 76 times [2018-10-10 15:14:28,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:31,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:31,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 15:14:31,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 15:14:31,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 15:14:31,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:14:31,125 INFO L87 Difference]: Start difference. First operand 294 states and 294 transitions. Second operand 80 states. [2018-10-10 15:14:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:35,092 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-10 15:14:35,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 15:14:35,093 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 293 [2018-10-10 15:14:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:35,094 INFO L225 Difference]: With dead ends: 299 [2018-10-10 15:14:35,094 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 15:14:35,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 15:14:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 15:14:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2018-10-10 15:14:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-10 15:14:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-10 15:14:35,098 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 293 [2018-10-10 15:14:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:35,098 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-10 15:14:35,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 15:14:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-10 15:14:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-10 15:14:35,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:35,100 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:35,100 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:35,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1531415067, now seen corresponding path program 77 times [2018-10-10 15:14:35,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:37,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:37,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:14:37,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:14:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:14:37,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:14:37,844 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 81 states. [2018-10-10 15:14:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:42,096 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-10 15:14:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:14:42,096 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 296 [2018-10-10 15:14:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:42,097 INFO L225 Difference]: With dead ends: 302 [2018-10-10 15:14:42,097 INFO L226 Difference]: Without dead ends: 302 [2018-10-10 15:14:42,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 15:14:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-10 15:14:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-10-10 15:14:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-10 15:14:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-10 15:14:42,101 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 296 [2018-10-10 15:14:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:42,101 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-10 15:14:42,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:14:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-10 15:14:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-10 15:14:42,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:42,102 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:42,102 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:42,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash 275790215, now seen corresponding path program 78 times [2018-10-10 15:14:42,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:45,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:45,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 15:14:45,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 15:14:45,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 15:14:45,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:14:45,157 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 82 states. [2018-10-10 15:14:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:49,302 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-10 15:14:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:14:49,302 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 299 [2018-10-10 15:14:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:49,303 INFO L225 Difference]: With dead ends: 305 [2018-10-10 15:14:49,303 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 15:14:49,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:14:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 15:14:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-10-10 15:14:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-10 15:14:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-10 15:14:49,307 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 299 [2018-10-10 15:14:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:49,307 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-10 15:14:49,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 15:14:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-10 15:14:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-10 15:14:49,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:49,309 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:49,309 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:49,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1313290917, now seen corresponding path program 79 times [2018-10-10 15:14:49,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:52,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:52,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:14:52,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:14:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:14:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:14:52,203 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 83 states. [2018-10-10 15:14:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:56,760 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-10 15:14:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 15:14:56,761 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 302 [2018-10-10 15:14:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:56,762 INFO L225 Difference]: With dead ends: 308 [2018-10-10 15:14:56,762 INFO L226 Difference]: Without dead ends: 308 [2018-10-10 15:14:56,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:14:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-10 15:14:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2018-10-10 15:14:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-10 15:14:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-10 15:14:56,765 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 302 [2018-10-10 15:14:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:56,766 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-10 15:14:56,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:14:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-10 15:14:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-10 15:14:56,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:56,767 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:14:56,767 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:56,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1382925113, now seen corresponding path program 80 times [2018-10-10 15:14:56,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:59,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:59,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 15:14:59,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 15:14:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 15:14:59,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:14:59,886 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 84 states. [2018-10-10 15:15:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:04,151 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-10 15:15:04,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:15:04,151 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 305 [2018-10-10 15:15:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:04,152 INFO L225 Difference]: With dead ends: 311 [2018-10-10 15:15:04,152 INFO L226 Difference]: Without dead ends: 311 [2018-10-10 15:15:04,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 15:15:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-10 15:15:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-10-10 15:15:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-10 15:15:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-10 15:15:04,156 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 305 [2018-10-10 15:15:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:04,156 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-10 15:15:04,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 15:15:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-10 15:15:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-10 15:15:04,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:04,157 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:15:04,158 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:04,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash 123694949, now seen corresponding path program 81 times [2018-10-10 15:15:04,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:07,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:07,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:15:07,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:15:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:15:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:15:07,408 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 85 states. [2018-10-10 15:15:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:11,887 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-10 15:15:11,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:15:11,888 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 308 [2018-10-10 15:15:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:11,889 INFO L225 Difference]: With dead ends: 314 [2018-10-10 15:15:11,889 INFO L226 Difference]: Without dead ends: 314 [2018-10-10 15:15:11,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-10 15:15:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-10 15:15:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-10-10 15:15:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-10 15:15:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2018-10-10 15:15:11,892 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 308 [2018-10-10 15:15:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:11,893 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2018-10-10 15:15:11,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:15:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2018-10-10 15:15:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-10 15:15:11,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:11,894 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:15:11,894 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:11,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1433718791, now seen corresponding path program 82 times [2018-10-10 15:15:11,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:15,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:15,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 15:15:15,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 15:15:15,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 15:15:15,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:15:15,176 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 86 states. [2018-10-10 15:15:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:19,695 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-10 15:15:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 15:15:19,695 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 311 [2018-10-10 15:15:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:19,696 INFO L225 Difference]: With dead ends: 317 [2018-10-10 15:15:19,696 INFO L226 Difference]: Without dead ends: 317 [2018-10-10 15:15:19,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 15:15:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-10 15:15:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-10-10 15:15:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-10 15:15:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-10 15:15:19,700 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 311 [2018-10-10 15:15:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:19,700 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-10 15:15:19,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-10 15:15:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-10 15:15:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-10 15:15:19,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:19,702 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:15:19,702 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:19,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash -13822939, now seen corresponding path program 83 times [2018-10-10 15:15:19,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:23,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:23,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:15:23,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:15:23,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:15:23,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:15:23,087 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 87 states. [2018-10-10 15:15:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:27,953 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-10-10 15:15:27,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:15:27,953 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 314 [2018-10-10 15:15:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:27,954 INFO L225 Difference]: With dead ends: 320 [2018-10-10 15:15:27,954 INFO L226 Difference]: Without dead ends: 320 [2018-10-10 15:15:27,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-10 15:15:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-10 15:15:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2018-10-10 15:15:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-10 15:15:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-10-10 15:15:27,957 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 314 [2018-10-10 15:15:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:27,958 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-10-10 15:15:27,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:15:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-10-10 15:15:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-10 15:15:27,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:27,959 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:15:27,959 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:27,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:27,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2037117767, now seen corresponding path program 84 times [2018-10-10 15:15:27,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:31,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-10 15:15:31,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-10 15:15:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-10 15:15:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:15:31,458 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 88 states. [2018-10-10 15:15:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:36,594 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-10 15:15:36,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:15:36,594 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 317 [2018-10-10 15:15:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:36,596 INFO L225 Difference]: With dead ends: 323 [2018-10-10 15:15:36,596 INFO L226 Difference]: Without dead ends: 323 [2018-10-10 15:15:36,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-10 15:15:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-10 15:15:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-10-10 15:15:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-10 15:15:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-10-10 15:15:36,599 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 317 [2018-10-10 15:15:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:36,600 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-10-10 15:15:36,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-10 15:15:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-10-10 15:15:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-10 15:15:36,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:36,602 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:15:36,602 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:36,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:36,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1406937317, now seen corresponding path program 85 times [2018-10-10 15:15:36,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:39,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:39,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:15:39,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:15:39,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:15:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:15:39,926 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 89 states. [2018-10-10 15:15:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:44,973 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2018-10-10 15:15:44,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 15:15:44,973 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 320 [2018-10-10 15:15:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:44,974 INFO L225 Difference]: With dead ends: 326 [2018-10-10 15:15:44,974 INFO L226 Difference]: Without dead ends: 326 [2018-10-10 15:15:44,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-10 15:15:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-10 15:15:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2018-10-10 15:15:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-10 15:15:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-10-10 15:15:44,978 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 320 [2018-10-10 15:15:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:44,979 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-10-10 15:15:44,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:15:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-10-10 15:15:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-10 15:15:44,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:44,980 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:15:44,980 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:44,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:44,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1003202183, now seen corresponding path program 86 times [2018-10-10 15:15:44,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:48,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:48,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-10 15:15:48,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-10 15:15:48,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-10 15:15:48,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:15:48,634 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 90 states. [2018-10-10 15:15:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:53,618 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-10 15:15:53,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:15:53,618 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 323 [2018-10-10 15:15:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:53,619 INFO L225 Difference]: With dead ends: 329 [2018-10-10 15:15:53,619 INFO L226 Difference]: Without dead ends: 329 [2018-10-10 15:15:53,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 15:15:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-10 15:15:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2018-10-10 15:15:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-10 15:15:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-10-10 15:15:53,625 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 323 [2018-10-10 15:15:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:53,625 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-10-10 15:15:53,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-10 15:15:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-10-10 15:15:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-10 15:15:53,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:53,626 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:15:53,626 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:53,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:53,627 INFO L82 PathProgramCache]: Analyzing trace with hash -761746011, now seen corresponding path program 87 times [2018-10-10 15:15:53,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:15:57,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:15:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:15:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:15:57,327 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 91 states. [2018-10-10 15:16:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:02,492 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-10 15:16:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:16:02,492 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 326 [2018-10-10 15:16:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:02,493 INFO L225 Difference]: With dead ends: 332 [2018-10-10 15:16:02,493 INFO L226 Difference]: Without dead ends: 332 [2018-10-10 15:16:02,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 15:16:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-10 15:16:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-10-10 15:16:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-10 15:16:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-10 15:16:02,497 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 326 [2018-10-10 15:16:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:02,497 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-10 15:16:02,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:16:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-10 15:16:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-10 15:16:02,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:02,498 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:16:02,499 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:02,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1343755833, now seen corresponding path program 88 times [2018-10-10 15:16:02,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:06,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:06,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-10 15:16:06,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-10 15:16:06,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-10 15:16:06,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:16:06,093 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 92 states. [2018-10-10 15:16:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:11,320 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-10 15:16:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 15:16:11,320 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 329 [2018-10-10 15:16:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:11,321 INFO L225 Difference]: With dead ends: 335 [2018-10-10 15:16:11,321 INFO L226 Difference]: Without dead ends: 335 [2018-10-10 15:16:11,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 15:16:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-10 15:16:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2018-10-10 15:16:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-10 15:16:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-10 15:16:11,325 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 329 [2018-10-10 15:16:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:11,325 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-10 15:16:11,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-10 15:16:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-10 15:16:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-10 15:16:11,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:11,326 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:16:11,327 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:11,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1215389083, now seen corresponding path program 89 times [2018-10-10 15:16:11,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:14,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:15,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:16:15,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:16:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:16:15,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:16:15,001 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 93 states. [2018-10-10 15:16:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:20,649 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-10-10 15:16:20,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:16:20,649 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 332 [2018-10-10 15:16:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:20,650 INFO L225 Difference]: With dead ends: 338 [2018-10-10 15:16:20,650 INFO L226 Difference]: Without dead ends: 338 [2018-10-10 15:16:20,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 15:16:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-10 15:16:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2018-10-10 15:16:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-10 15:16:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-10-10 15:16:20,654 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 332 [2018-10-10 15:16:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:20,654 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-10-10 15:16:20,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:16:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-10-10 15:16:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-10 15:16:20,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:20,655 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:16:20,656 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:20,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash 437566727, now seen corresponding path program 90 times [2018-10-10 15:16:20,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:24,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:24,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-10 15:16:24,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-10 15:16:24,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-10 15:16:24,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:16:24,616 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 94 states. [2018-10-10 15:16:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:29,963 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-10-10 15:16:29,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:16:29,963 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 335 [2018-10-10 15:16:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:29,964 INFO L225 Difference]: With dead ends: 341 [2018-10-10 15:16:29,965 INFO L226 Difference]: Without dead ends: 341 [2018-10-10 15:16:29,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 15:16:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-10 15:16:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2018-10-10 15:16:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 15:16:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-10 15:16:29,969 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 335 [2018-10-10 15:16:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:29,970 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-10 15:16:29,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-10 15:16:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-10 15:16:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-10 15:16:29,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:29,971 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:16:29,971 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:29,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:29,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1844053797, now seen corresponding path program 91 times [2018-10-10 15:16:29,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:33,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:33,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:16:33,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:16:33,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:16:33,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:16:33,951 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 95 states. [2018-10-10 15:16:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:39,669 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-10 15:16:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 15:16:39,670 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 338 [2018-10-10 15:16:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:39,671 INFO L225 Difference]: With dead ends: 344 [2018-10-10 15:16:39,671 INFO L226 Difference]: Without dead ends: 344 [2018-10-10 15:16:39,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-10 15:16:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-10 15:16:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2018-10-10 15:16:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-10 15:16:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2018-10-10 15:16:39,701 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 338 [2018-10-10 15:16:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:39,701 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2018-10-10 15:16:39,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:16:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2018-10-10 15:16:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-10 15:16:39,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:39,702 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:16:39,702 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:39,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash 799416391, now seen corresponding path program 92 times [2018-10-10 15:16:39,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:43,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:43,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-10 15:16:43,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-10 15:16:43,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-10 15:16:43,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:16:43,595 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 96 states. [2018-10-10 15:16:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:49,161 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-10-10 15:16:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:16:49,162 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 341 [2018-10-10 15:16:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:49,163 INFO L225 Difference]: With dead ends: 347 [2018-10-10 15:16:49,163 INFO L226 Difference]: Without dead ends: 347 [2018-10-10 15:16:49,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-10 15:16:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-10 15:16:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2018-10-10 15:16:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-10 15:16:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-10-10 15:16:49,166 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 341 [2018-10-10 15:16:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:49,167 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-10-10 15:16:49,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-10 15:16:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-10-10 15:16:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-10 15:16:49,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:49,168 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:16:49,168 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:49,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:49,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1339481061, now seen corresponding path program 93 times [2018-10-10 15:16:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:53,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:53,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:16:53,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:16:53,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:16:53,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:16:53,339 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 97 states. [2018-10-10 15:16:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:59,338 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-10-10 15:16:59,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:16:59,339 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 344 [2018-10-10 15:16:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:59,340 INFO L225 Difference]: With dead ends: 348 [2018-10-10 15:16:59,340 INFO L226 Difference]: Without dead ends: 348 [2018-10-10 15:16:59,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-10 15:16:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-10 15:16:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-10-10 15:16:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-10 15:16:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-10-10 15:16:59,344 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 344 [2018-10-10 15:16:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:59,344 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-10-10 15:16:59,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:16:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-10-10 15:16:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-10 15:16:59,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:59,345 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:16:59,345 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:59,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1458574215, now seen corresponding path program 94 times [2018-10-10 15:16:59,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-10 15:16:59,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:16:59,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 15:16:59,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:16:59,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:16:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:16:59,890 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 8 states. [2018-10-10 15:17:00,875 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 15:17:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:00,887 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-10 15:17:00,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:17:00,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 347 [2018-10-10 15:17:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:00,889 INFO L225 Difference]: With dead ends: 346 [2018-10-10 15:17:00,889 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:17:00,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:17:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:17:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:17:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:17:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:17:00,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 347 [2018-10-10 15:17:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:00,890 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:17:00,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:17:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:17:00,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:17:00,896 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:17:00 BoogieIcfgContainer [2018-10-10 15:17:00,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:17:00,897 INFO L168 Benchmark]: Toolchain (without parser) took 367712.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 132.1 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 431.3 MB). Peak memory consumption was 563.4 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:00,898 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:17:00,898 INFO L168 Benchmark]: Boogie Preprocessor took 74.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:17:00,899 INFO L168 Benchmark]: RCFGBuilder took 660.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:00,899 INFO L168 Benchmark]: TraceAbstraction took 366971.81 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 132.1 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 399.6 MB). Peak memory consumption was 531.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:00,902 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 660.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 366971.81 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 132.1 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 399.6 MB). Peak memory consumption was 531.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 1 error locations. SAFE Result, 366.9s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 211.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5874 SDtfs, 22301 SDslu, 194430 SDs, 0 SdLazy, 30432 SolverSat, 4604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9130 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138419 ImplicationChecksByTransitivity, 316.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 148.0s InterpolantComputationTime, 19570 NumberOfCodeBlocks, 19570 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 19475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19188291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 13207/419710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_13.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-17-00-911.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_13.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-17-00-911.csv Received shutdown request...