java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:26:23,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:26:23,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:26:23,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:26:23,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:26:23,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:26:23,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:26:23,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:26:23,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:26:23,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:26:23,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:26:23,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:26:23,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:26:23,538 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:26:23,539 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:26:23,540 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:26:23,540 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:26:23,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:26:23,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:26:23,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:26:23,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:26:23,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:26:23,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:26:23,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:26:23,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:26:23,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:26:23,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:26:23,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:26:23,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:26:23,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:26:23,555 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:26:23,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:26:23,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:26:23,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:26:23,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:26:23,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:26:23,560 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:26:23,578 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:26:23,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:26:23,579 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:26:23,580 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:26:23,580 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:26:23,580 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:26:23,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:26:23,581 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:26:23,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:26:23,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:26:23,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:26:23,582 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:26:23,582 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:26:23,584 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:26:23,584 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:26:23,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:26:23,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:26:23,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:26:23,693 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:26:23,694 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:26:23,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:26:23,695 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call1_true-termination.i_3.bpl' [2018-10-15 12:26:23,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:26:23,754 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:26:23,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:26:23,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:26:23,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:26:23,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:23,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:23,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:23,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:23,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:23,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:23,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:23,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:26:23,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:26:23,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:26:23,817 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:26:23,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 12:26:23,917 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:26:23,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:26:23,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:26:24,341 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:26:24,342 INFO L202 PluginConnector]: Adding new model array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:24 BoogieIcfgContainer [2018-10-15 12:26:24,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:26:24,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:26:24,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:26:24,348 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:26:24,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/2) ... [2018-10-15 12:26:24,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4be340 and model type array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:26:24, skipping insertion in model container [2018-10-15 12:26:24,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:24" (2/2) ... [2018-10-15 12:26:24,352 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:26:24,361 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:26:24,370 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:26:24,389 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:26:24,416 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:26:24,417 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:26:24,417 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:26:24,417 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:26:24,417 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:26:24,418 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:26:24,418 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:26:24,418 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:26:24,418 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:26:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-15 12:26:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 12:26:24,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:24,448 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] [2018-10-15 12:26:24,453 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:24,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:24,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1858663592, now seen corresponding path program 1 times [2018-10-15 12:26:24,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:26:24,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:26:24,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:26:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:26:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:26:24,658 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-10-15 12:26:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:24,737 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 12:26:24,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:26:24,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-15 12:26:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:24,750 INFO L225 Difference]: With dead ends: 41 [2018-10-15 12:26:24,750 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 12:26:24,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:26:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 12:26:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-10-15 12:26:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 12:26:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 12:26:24,791 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 26 [2018-10-15 12:26:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:24,792 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 12:26:24,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:26:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 12:26:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 12:26:24,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:24,794 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] [2018-10-15 12:26:24,794 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:24,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:24,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2079144868, now seen corresponding path program 1 times [2018-10-15 12:26:24,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:24,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:24,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:26:24,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:26:24,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:26:24,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:26:24,907 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 5 states. [2018-10-15 12:26:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:25,164 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:26:25,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:26:25,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-10-15 12:26:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:25,169 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:26:25,169 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 12:26:25,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:26:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 12:26:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-10-15 12:26:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:26:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 12:26:25,184 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2018-10-15 12:26:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:25,185 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 12:26:25,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:26:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 12:26:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:26:25,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:25,189 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:25,189 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:25,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash 825702752, now seen corresponding path program 2 times [2018-10-15 12:26:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:25,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:25,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:26:25,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:26:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:26:25,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:26:25,441 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 7 states. [2018-10-15 12:26:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:25,672 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 12:26:25,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:26:25,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-10-15 12:26:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:25,675 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:26:25,675 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 12:26:25,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:26:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 12:26:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-10-15 12:26:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:26:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 12:26:25,683 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 42 [2018-10-15 12:26:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:25,684 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 12:26:25,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:26:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 12:26:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:26:25,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:25,687 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:25,688 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:25,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:25,689 INFO L82 PathProgramCache]: Analyzing trace with hash 304638564, now seen corresponding path program 3 times [2018-10-15 12:26:25,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:25,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:25,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:26:25,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:26:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:26:25,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:26:25,924 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 9 states. [2018-10-15 12:26:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:26,276 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 12:26:26,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:26:26,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-10-15 12:26:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:26,278 INFO L225 Difference]: With dead ends: 65 [2018-10-15 12:26:26,281 INFO L226 Difference]: Without dead ends: 65 [2018-10-15 12:26:26,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-15 12:26:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-10-15 12:26:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 12:26:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 12:26:26,295 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 50 [2018-10-15 12:26:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:26,299 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 12:26:26,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:26:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 12:26:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:26:26,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:26,301 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:26,302 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:26,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash -597010584, now seen corresponding path program 4 times [2018-10-15 12:26:26,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:26,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:26,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:26:26,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:26:26,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:26:26,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:26:26,631 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 11 states. [2018-10-15 12:26:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:26,910 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-15 12:26:26,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:26:26,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-15 12:26:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:26,916 INFO L225 Difference]: With dead ends: 73 [2018-10-15 12:26:26,918 INFO L226 Difference]: Without dead ends: 73 [2018-10-15 12:26:26,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-15 12:26:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2018-10-15 12:26:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 12:26:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 12:26:26,936 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 58 [2018-10-15 12:26:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:26,937 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 12:26:26,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:26:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 12:26:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 12:26:26,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:26,938 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:26,939 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:26,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2122252180, now seen corresponding path program 5 times [2018-10-15 12:26:26,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:27,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:27,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:26:27,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:26:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:26:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:26:27,226 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 13 states. [2018-10-15 12:26:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:28,171 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:26:28,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:26:28,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-10-15 12:26:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:28,174 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:26:28,174 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:26:28,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:26:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:26:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2018-10-15 12:26:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:26:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 12:26:28,181 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 66 [2018-10-15 12:26:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:28,181 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 12:26:28,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:26:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 12:26:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 12:26:28,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:28,183 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:28,184 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:28,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash 787506544, now seen corresponding path program 6 times [2018-10-15 12:26:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:28,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:28,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:26:28,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:26:28,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:26:28,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:28,563 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 15 states. [2018-10-15 12:26:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:28,970 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 12:26:28,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:26:28,971 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-10-15 12:26:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:28,972 INFO L225 Difference]: With dead ends: 89 [2018-10-15 12:26:28,972 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 12:26:28,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 12:26:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-10-15 12:26:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:26:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:26:28,981 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 74 [2018-10-15 12:26:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:28,981 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:26:28,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:26:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:26:28,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:26:28,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:28,983 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:28,984 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:28,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:28,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1312589428, now seen corresponding path program 7 times [2018-10-15 12:26:28,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:29,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:29,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:26:29,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:26:29,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:26:29,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:26:29,219 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 17 states. [2018-10-15 12:26:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:29,604 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 12:26:29,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:26:29,604 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-10-15 12:26:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:29,605 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:26:29,606 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:26:29,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:26:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-10-15 12:26:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:26:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:26:29,615 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 82 [2018-10-15 12:26:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:29,615 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:26:29,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:26:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:26:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:26:29,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:29,617 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:29,618 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:29,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:29,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2065079432, now seen corresponding path program 8 times [2018-10-15 12:26:29,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:29,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:29,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:26:29,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:26:29,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:26:29,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:29,884 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 19 states. [2018-10-15 12:26:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:30,806 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-15 12:26:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:26:30,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 90 [2018-10-15 12:26:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:30,809 INFO L225 Difference]: With dead ends: 105 [2018-10-15 12:26:30,809 INFO L226 Difference]: Without dead ends: 105 [2018-10-15 12:26:30,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-15 12:26:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2018-10-15 12:26:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 12:26:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 12:26:30,817 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 90 [2018-10-15 12:26:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:30,819 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 12:26:30,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:26:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 12:26:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 12:26:30,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:30,822 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:30,827 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:30,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1267008388, now seen corresponding path program 9 times [2018-10-15 12:26:30,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:31,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:31,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:26:31,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:26:31,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:26:31,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:26:31,288 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 21 states. [2018-10-15 12:26:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:31,784 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-15 12:26:31,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:26:31,785 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 98 [2018-10-15 12:26:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:31,787 INFO L225 Difference]: With dead ends: 113 [2018-10-15 12:26:31,787 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 12:26:31,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 12:26:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-10-15 12:26:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 12:26:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 12:26:31,793 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 98 [2018-10-15 12:26:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:31,794 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 12:26:31,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:26:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 12:26:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:26:31,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:31,796 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:31,796 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:31,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash -92974720, now seen corresponding path program 10 times [2018-10-15 12:26:31,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:32,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:32,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:26:32,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:26:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:26:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:26:32,173 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 23 states. [2018-10-15 12:26:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:32,600 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 12:26:32,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:26:32,600 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2018-10-15 12:26:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:32,602 INFO L225 Difference]: With dead ends: 121 [2018-10-15 12:26:32,602 INFO L226 Difference]: Without dead ends: 121 [2018-10-15 12:26:32,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-15 12:26:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2018-10-15 12:26:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:26:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:26:32,608 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 106 [2018-10-15 12:26:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:32,608 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:26:32,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:26:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:26:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:26:32,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:32,610 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:32,611 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:32,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1336122748, now seen corresponding path program 11 times [2018-10-15 12:26:32,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:33,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:33,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:26:33,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:26:33,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:26:33,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:26:33,079 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 25 states. [2018-10-15 12:26:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:33,790 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 12:26:33,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:26:33,791 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 114 [2018-10-15 12:26:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:33,792 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:26:33,793 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 12:26:33,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 12:26:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-10-15 12:26:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 12:26:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 12:26:33,798 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 114 [2018-10-15 12:26:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:33,799 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 12:26:33,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:26:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 12:26:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 12:26:33,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:33,801 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:33,801 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:33,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1806970760, now seen corresponding path program 12 times [2018-10-15 12:26:33,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:34,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:34,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:26:34,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:26:34,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:26:34,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:34,130 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 27 states. [2018-10-15 12:26:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:34,733 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 12:26:34,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:26:34,733 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-10-15 12:26:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:34,735 INFO L225 Difference]: With dead ends: 137 [2018-10-15 12:26:34,735 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 12:26:34,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:26:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 12:26:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2018-10-15 12:26:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 12:26:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 12:26:34,740 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 122 [2018-10-15 12:26:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:34,740 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 12:26:34,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:26:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 12:26:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:26:34,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:34,742 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:34,742 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:34,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash -33507188, now seen corresponding path program 13 times [2018-10-15 12:26:34,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:36,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:36,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:26:36,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:26:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:26:36,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:26:36,505 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 29 states. [2018-10-15 12:26:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:37,734 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-15 12:26:37,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:26:37,736 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 130 [2018-10-15 12:26:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:37,738 INFO L225 Difference]: With dead ends: 145 [2018-10-15 12:26:37,738 INFO L226 Difference]: Without dead ends: 145 [2018-10-15 12:26:37,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:26:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-15 12:26:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-10-15 12:26:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 12:26:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 12:26:37,744 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 130 [2018-10-15 12:26:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:37,744 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 12:26:37,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:26:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 12:26:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 12:26:37,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:37,746 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:37,746 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:37,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1959132560, now seen corresponding path program 14 times [2018-10-15 12:26:37,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:38,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:38,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:26:38,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:26:38,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:26:38,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:38,218 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 31 states. [2018-10-15 12:26:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:38,897 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 12:26:38,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:26:38,898 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 138 [2018-10-15 12:26:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:38,900 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:26:38,900 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:26:38,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:26:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:26:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2018-10-15 12:26:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 12:26:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 12:26:38,905 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 138 [2018-10-15 12:26:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:38,906 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 12:26:38,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:26:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 12:26:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 12:26:38,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:38,907 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:38,907 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:38,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash 428342932, now seen corresponding path program 15 times [2018-10-15 12:26:38,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:40,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:40,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:26:40,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:26:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:26:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:26:40,059 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 33 states. [2018-10-15 12:26:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:40,801 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-15 12:26:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:26:40,802 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 146 [2018-10-15 12:26:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:40,804 INFO L225 Difference]: With dead ends: 161 [2018-10-15 12:26:40,804 INFO L226 Difference]: Without dead ends: 161 [2018-10-15 12:26:40,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:26:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-15 12:26:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-10-15 12:26:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:26:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:26:40,809 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 146 [2018-10-15 12:26:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:40,809 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:26:40,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:26:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:26:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:26:40,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:40,811 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:40,811 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:40,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1909111704, now seen corresponding path program 16 times [2018-10-15 12:26:40,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 0 proven. 976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:41,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:41,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:26:41,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:26:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:26:41,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:41,779 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 35 states. [2018-10-15 12:26:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:42,517 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 12:26:42,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:26:42,517 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 154 [2018-10-15 12:26:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:42,519 INFO L225 Difference]: With dead ends: 169 [2018-10-15 12:26:42,519 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 12:26:42,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:26:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 12:26:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2018-10-15 12:26:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 12:26:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 12:26:42,524 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 154 [2018-10-15 12:26:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:42,525 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 12:26:42,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:26:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 12:26:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 12:26:42,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:42,526 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:42,527 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:42,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:42,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1058157724, now seen corresponding path program 17 times [2018-10-15 12:26:42,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 1105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:26:43,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:26:43,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:26:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:26:43,128 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 37 states. [2018-10-15 12:26:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:44,073 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-15 12:26:44,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:26:44,073 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 162 [2018-10-15 12:26:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:44,075 INFO L225 Difference]: With dead ends: 177 [2018-10-15 12:26:44,075 INFO L226 Difference]: Without dead ends: 177 [2018-10-15 12:26:44,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:26:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-15 12:26:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2018-10-15 12:26:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 12:26:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 12:26:44,080 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 162 [2018-10-15 12:26:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:44,080 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 12:26:44,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:26:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 12:26:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:26:44,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:44,082 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:44,082 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:44,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2128767392, now seen corresponding path program 18 times [2018-10-15 12:26:44,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:44,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:44,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:26:44,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:26:44,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:26:44,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:44,615 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 39 states. [2018-10-15 12:26:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:45,502 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-15 12:26:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:26:45,503 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 170 [2018-10-15 12:26:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:45,505 INFO L225 Difference]: With dead ends: 185 [2018-10-15 12:26:45,505 INFO L226 Difference]: Without dead ends: 185 [2018-10-15 12:26:45,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:26:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-15 12:26:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2018-10-15 12:26:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 12:26:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-15 12:26:45,511 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 170 [2018-10-15 12:26:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:45,512 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-15 12:26:45,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:26:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-15 12:26:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:26:45,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:45,513 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:45,513 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:45,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:45,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1790925476, now seen corresponding path program 19 times [2018-10-15 12:26:45,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 1387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:46,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:46,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:26:46,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:26:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:26:46,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:26:46,183 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 41 states. [2018-10-15 12:26:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:47,350 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-15 12:26:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:26:47,351 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-10-15 12:26:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:47,352 INFO L225 Difference]: With dead ends: 193 [2018-10-15 12:26:47,352 INFO L226 Difference]: Without dead ends: 193 [2018-10-15 12:26:47,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:26:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-15 12:26:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2018-10-15 12:26:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 12:26:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 12:26:47,357 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 178 [2018-10-15 12:26:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:47,358 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 12:26:47,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:26:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 12:26:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 12:26:47,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:47,359 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:47,359 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:47,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:47,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2016217000, now seen corresponding path program 20 times [2018-10-15 12:26:47,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:48,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:48,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:26:48,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:26:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:26:48,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:48,005 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 43 states. [2018-10-15 12:26:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:49,031 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-15 12:26:49,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:26:49,031 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 186 [2018-10-15 12:26:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:49,033 INFO L225 Difference]: With dead ends: 201 [2018-10-15 12:26:49,033 INFO L226 Difference]: Without dead ends: 201 [2018-10-15 12:26:49,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:26:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-15 12:26:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2018-10-15 12:26:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 12:26:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-15 12:26:49,038 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 186 [2018-10-15 12:26:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:49,039 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-15 12:26:49,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:26:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-15 12:26:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-15 12:26:49,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:49,040 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:49,040 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:49,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1487892652, now seen corresponding path program 21 times [2018-10-15 12:26:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:50,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:50,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:26:50,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:26:50,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:26:50,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:26:50,065 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 45 states. [2018-10-15 12:26:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:51,418 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 12:26:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:26:51,425 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 194 [2018-10-15 12:26:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:51,426 INFO L225 Difference]: With dead ends: 209 [2018-10-15 12:26:51,427 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 12:26:51,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:26:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 12:26:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2018-10-15 12:26:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 12:26:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-15 12:26:51,431 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 194 [2018-10-15 12:26:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:51,432 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-15 12:26:51,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:26:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-15 12:26:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:26:51,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:51,433 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:51,434 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:51,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:51,434 INFO L82 PathProgramCache]: Analyzing trace with hash -104163920, now seen corresponding path program 22 times [2018-10-15 12:26:51,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 0 proven. 1870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:52,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:52,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:26:52,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:26:52,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:26:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:52,404 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 47 states. [2018-10-15 12:26:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:53,879 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-15 12:26:53,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:26:53,880 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 202 [2018-10-15 12:26:53,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:53,882 INFO L225 Difference]: With dead ends: 217 [2018-10-15 12:26:53,882 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 12:26:53,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:26:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 12:26:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2018-10-15 12:26:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 12:26:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 12:26:53,887 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 202 [2018-10-15 12:26:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:53,888 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 12:26:53,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:26:53,888 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 12:26:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 12:26:53,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:53,889 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:53,889 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:53,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:53,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2063436108, now seen corresponding path program 23 times [2018-10-15 12:26:53,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2047 backedges. 0 proven. 2047 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:55,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:55,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:26:55,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:26:55,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:26:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:26:55,320 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 49 states. [2018-10-15 12:26:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:56,932 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 12:26:56,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:26:56,934 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 210 [2018-10-15 12:26:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:56,936 INFO L225 Difference]: With dead ends: 225 [2018-10-15 12:26:56,936 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:26:56,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:26:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:26:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2018-10-15 12:26:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-15 12:26:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-15 12:26:56,941 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 210 [2018-10-15 12:26:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:56,942 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-15 12:26:56,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:26:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-15 12:26:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 12:26:56,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:56,943 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:56,944 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:56,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1608192952, now seen corresponding path program 24 times [2018-10-15 12:26:56,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 2232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:58,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:58,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:26:58,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:26:58,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:26:58,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:26:58,579 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 51 states. [2018-10-15 12:27:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:00,027 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-15 12:27:00,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:27:00,027 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 218 [2018-10-15 12:27:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:00,029 INFO L225 Difference]: With dead ends: 233 [2018-10-15 12:27:00,030 INFO L226 Difference]: Without dead ends: 233 [2018-10-15 12:27:00,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:27:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-15 12:27:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2018-10-15 12:27:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:27:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:27:00,036 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 218 [2018-10-15 12:27:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:00,036 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:27:00,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:27:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:27:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:27:00,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:00,038 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:00,038 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:00,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:00,039 INFO L82 PathProgramCache]: Analyzing trace with hash 735603900, now seen corresponding path program 25 times [2018-10-15 12:27:00,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2425 backedges. 0 proven. 2425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:02,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:02,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:27:02,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:27:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:27:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:27:02,099 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 53 states. [2018-10-15 12:27:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:04,087 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-15 12:27:04,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:27:04,087 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 226 [2018-10-15 12:27:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:04,089 INFO L225 Difference]: With dead ends: 241 [2018-10-15 12:27:04,089 INFO L226 Difference]: Without dead ends: 241 [2018-10-15 12:27:04,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:27:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-15 12:27:04,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2018-10-15 12:27:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-15 12:27:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-15 12:27:04,095 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 226 [2018-10-15 12:27:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:04,095 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-15 12:27:04,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:27:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-15 12:27:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-15 12:27:04,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:04,097 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:04,097 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:04,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash -964787776, now seen corresponding path program 26 times [2018-10-15 12:27:04,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 0 proven. 2626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:05,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:05,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:27:05,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:27:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:27:05,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:27:05,154 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 55 states. [2018-10-15 12:27:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:07,315 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-15 12:27:07,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:27:07,315 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-10-15 12:27:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:07,317 INFO L225 Difference]: With dead ends: 249 [2018-10-15 12:27:07,317 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 12:27:07,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:27:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 12:27:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 243. [2018-10-15 12:27:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 12:27:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 12:27:07,323 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 234 [2018-10-15 12:27:07,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:07,324 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 12:27:07,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:27:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 12:27:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 12:27:07,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:07,326 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:07,326 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:07,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1230066372, now seen corresponding path program 27 times [2018-10-15 12:27:07,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2835 backedges. 0 proven. 2835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:08,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:08,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:27:08,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:27:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:27:08,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:27:08,924 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 57 states. [2018-10-15 12:27:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:10,900 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-15 12:27:10,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:27:10,901 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 242 [2018-10-15 12:27:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:10,902 INFO L225 Difference]: With dead ends: 257 [2018-10-15 12:27:10,902 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 12:27:10,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:27:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 12:27:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 251. [2018-10-15 12:27:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 12:27:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-15 12:27:10,907 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 242 [2018-10-15 12:27:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:10,908 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-15 12:27:10,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:27:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-15 12:27:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 12:27:10,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:10,910 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:10,910 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:10,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 164945864, now seen corresponding path program 28 times [2018-10-15 12:27:10,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3052 backedges. 0 proven. 3052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:12,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:12,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:27:12,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:27:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:27:12,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:27:12,368 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 59 states. [2018-10-15 12:27:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:15,014 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-15 12:27:15,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:27:15,014 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 250 [2018-10-15 12:27:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:15,016 INFO L225 Difference]: With dead ends: 265 [2018-10-15 12:27:15,016 INFO L226 Difference]: Without dead ends: 265 [2018-10-15 12:27:15,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:27:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-15 12:27:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2018-10-15 12:27:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 12:27:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-15 12:27:15,022 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 250 [2018-10-15 12:27:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:15,023 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-15 12:27:15,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:27:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-15 12:27:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 12:27:15,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:15,024 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:15,025 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:15,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:15,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1718802228, now seen corresponding path program 29 times [2018-10-15 12:27:15,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3277 backedges. 0 proven. 3277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:17,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:17,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:27:17,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:27:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:27:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:27:17,570 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 61 states. [2018-10-15 12:27:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:19,682 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-10-15 12:27:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:27:19,682 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 258 [2018-10-15 12:27:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:19,684 INFO L225 Difference]: With dead ends: 273 [2018-10-15 12:27:19,684 INFO L226 Difference]: Without dead ends: 273 [2018-10-15 12:27:19,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:27:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-15 12:27:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-10-15 12:27:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-15 12:27:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-15 12:27:19,690 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 258 [2018-10-15 12:27:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:19,691 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-15 12:27:19,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:27:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-15 12:27:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-15 12:27:19,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:19,693 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:19,693 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:19,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -973197872, now seen corresponding path program 30 times [2018-10-15 12:27:19,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3510 backedges. 0 proven. 3510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:21,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:21,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:27:21,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:27:21,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:27:21,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:27:21,245 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 63 states. [2018-10-15 12:27:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:23,597 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 12:27:23,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:27:23,598 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 266 [2018-10-15 12:27:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:23,600 INFO L225 Difference]: With dead ends: 281 [2018-10-15 12:27:23,600 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 12:27:23,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:27:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 12:27:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2018-10-15 12:27:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-15 12:27:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-15 12:27:23,605 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 266 [2018-10-15 12:27:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:23,605 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-15 12:27:23,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:27:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-15 12:27:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-15 12:27:23,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:23,607 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:23,607 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:23,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:23,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1733562668, now seen corresponding path program 31 times [2018-10-15 12:27:23,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:25,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:25,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:27:25,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:27:25,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:27:25,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:27:25,137 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 65 states. [2018-10-15 12:27:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:27,862 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-15 12:27:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:27:27,863 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 274 [2018-10-15 12:27:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:27,865 INFO L225 Difference]: With dead ends: 289 [2018-10-15 12:27:27,865 INFO L226 Difference]: Without dead ends: 289 [2018-10-15 12:27:27,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:27:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-15 12:27:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 283. [2018-10-15 12:27:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 12:27:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 12:27:27,870 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 274 [2018-10-15 12:27:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:27,870 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 12:27:27,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:27:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 12:27:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 12:27:27,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:27,872 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:27,872 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:27,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1461349336, now seen corresponding path program 32 times [2018-10-15 12:27:27,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 4000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:29,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:29,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:27:29,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:27:29,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:27:29,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:27:29,279 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 67 states. [2018-10-15 12:27:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:31,847 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-15 12:27:31,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:27:31,848 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 282 [2018-10-15 12:27:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:31,849 INFO L225 Difference]: With dead ends: 297 [2018-10-15 12:27:31,849 INFO L226 Difference]: Without dead ends: 297 [2018-10-15 12:27:31,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:27:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-15 12:27:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2018-10-15 12:27:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-15 12:27:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-15 12:27:31,855 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 282 [2018-10-15 12:27:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:31,855 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-15 12:27:31,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:27:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-15 12:27:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-15 12:27:31,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:31,857 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:31,858 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:31,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2100452132, now seen corresponding path program 33 times [2018-10-15 12:27:31,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4257 backedges. 0 proven. 4257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:33,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:33,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:27:33,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:27:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:27:33,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:27:33,655 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 69 states. [2018-10-15 12:27:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:36,214 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-15 12:27:36,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:27:36,214 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 290 [2018-10-15 12:27:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:36,215 INFO L225 Difference]: With dead ends: 305 [2018-10-15 12:27:36,216 INFO L226 Difference]: Without dead ends: 305 [2018-10-15 12:27:36,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:27:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-15 12:27:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2018-10-15 12:27:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 12:27:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-15 12:27:36,220 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 290 [2018-10-15 12:27:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:36,220 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-15 12:27:36,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:27:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-15 12:27:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 12:27:36,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:36,222 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:36,222 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:36,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash -649487904, now seen corresponding path program 34 times [2018-10-15 12:27:36,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4522 backedges. 0 proven. 4522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:37,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:37,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:27:37,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:27:37,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:27:37,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:27:37,997 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 71 states. [2018-10-15 12:27:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:40,616 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-15 12:27:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:27:40,617 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 298 [2018-10-15 12:27:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:40,619 INFO L225 Difference]: With dead ends: 313 [2018-10-15 12:27:40,619 INFO L226 Difference]: Without dead ends: 313 [2018-10-15 12:27:40,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:27:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-15 12:27:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2018-10-15 12:27:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-15 12:27:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-15 12:27:40,624 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 298 [2018-10-15 12:27:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:40,624 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-15 12:27:40,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:27:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-15 12:27:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-15 12:27:40,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:40,626 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:40,626 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:40,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1410484964, now seen corresponding path program 35 times [2018-10-15 12:27:40,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4795 backedges. 0 proven. 4795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:42,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:42,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:27:42,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:27:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:27:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:27:42,465 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 73 states. [2018-10-15 12:27:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:45,494 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-15 12:27:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:27:45,494 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 306 [2018-10-15 12:27:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:45,497 INFO L225 Difference]: With dead ends: 321 [2018-10-15 12:27:45,497 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 12:27:45,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:27:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 12:27:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2018-10-15 12:27:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 12:27:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-15 12:27:45,503 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 306 [2018-10-15 12:27:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:45,503 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-15 12:27:45,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:27:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-15 12:27:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-15 12:27:45,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:45,506 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:45,506 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:45,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash 682342376, now seen corresponding path program 36 times [2018-10-15 12:27:45,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5076 backedges. 0 proven. 5076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:47,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:47,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:27:47,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:27:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:27:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:27:47,584 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 75 states. [2018-10-15 12:27:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:50,767 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-15 12:27:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:27:50,767 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 314 [2018-10-15 12:27:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:50,769 INFO L225 Difference]: With dead ends: 329 [2018-10-15 12:27:50,769 INFO L226 Difference]: Without dead ends: 329 [2018-10-15 12:27:50,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:27:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-15 12:27:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2018-10-15 12:27:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-15 12:27:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-15 12:27:50,775 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 314 [2018-10-15 12:27:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:50,776 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-15 12:27:50,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:27:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-15 12:27:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-15 12:27:50,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:50,778 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:50,778 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:50,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:50,778 INFO L82 PathProgramCache]: Analyzing trace with hash -929439508, now seen corresponding path program 37 times [2018-10-15 12:27:50,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5365 backedges. 0 proven. 5365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:52,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:52,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:27:52,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:27:52,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:27:52,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:27:52,761 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 77 states. [2018-10-15 12:27:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:56,041 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-15 12:27:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:27:56,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 322 [2018-10-15 12:27:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:56,043 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:27:56,043 INFO L226 Difference]: Without dead ends: 337 [2018-10-15 12:27:56,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:27:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-15 12:27:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 331. [2018-10-15 12:27:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 12:27:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-15 12:27:56,049 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 322 [2018-10-15 12:27:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:56,049 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-15 12:27:56,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:27:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-15 12:27:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-15 12:27:56,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:56,051 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:56,051 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:56,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash -513751568, now seen corresponding path program 38 times [2018-10-15 12:27:56,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5662 backedges. 0 proven. 5662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:57,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:57,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:27:57,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:27:57,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:27:57,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:27:57,915 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 79 states. [2018-10-15 12:28:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:01,211 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-15 12:28:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:28:01,212 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 330 [2018-10-15 12:28:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:01,214 INFO L225 Difference]: With dead ends: 345 [2018-10-15 12:28:01,214 INFO L226 Difference]: Without dead ends: 345 [2018-10-15 12:28:01,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:28:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-15 12:28:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 339. [2018-10-15 12:28:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-15 12:28:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-15 12:28:01,220 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 330 [2018-10-15 12:28:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:01,220 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-15 12:28:01,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:28:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-15 12:28:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-15 12:28:01,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:01,223 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:01,223 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:01,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1552180980, now seen corresponding path program 39 times [2018-10-15 12:28:01,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5967 backedges. 0 proven. 5967 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:03,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:03,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:28:03,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:28:03,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:28:03,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:28:03,372 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 81 states. [2018-10-15 12:28:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:06,744 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-15 12:28:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:28:06,744 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 338 [2018-10-15 12:28:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:06,747 INFO L225 Difference]: With dead ends: 353 [2018-10-15 12:28:06,747 INFO L226 Difference]: Without dead ends: 353 [2018-10-15 12:28:06,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:28:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-15 12:28:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 347. [2018-10-15 12:28:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-15 12:28:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-15 12:28:06,752 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 338 [2018-10-15 12:28:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:06,753 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-15 12:28:06,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:28:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-15 12:28:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-15 12:28:06,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:06,755 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:06,755 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:06,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1602798584, now seen corresponding path program 40 times [2018-10-15 12:28:06,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6280 backedges. 0 proven. 6280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:09,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:09,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:28:09,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:28:09,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:28:09,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:28:09,312 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 83 states. [2018-10-15 12:28:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:12,964 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-10-15 12:28:12,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:28:12,964 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 346 [2018-10-15 12:28:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:12,966 INFO L225 Difference]: With dead ends: 361 [2018-10-15 12:28:12,966 INFO L226 Difference]: Without dead ends: 361 [2018-10-15 12:28:12,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:28:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-15 12:28:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 355. [2018-10-15 12:28:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-15 12:28:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-10-15 12:28:12,971 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 346 [2018-10-15 12:28:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:12,972 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-10-15 12:28:12,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:28:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-10-15 12:28:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-15 12:28:12,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:12,974 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:12,974 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:12,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1274141948, now seen corresponding path program 41 times [2018-10-15 12:28:12,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6601 backedges. 0 proven. 6601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:15,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:15,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:28:15,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:28:15,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:28:15,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:28:15,479 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 85 states. [2018-10-15 12:28:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:19,406 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-10-15 12:28:19,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:28:19,406 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 354 [2018-10-15 12:28:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:19,409 INFO L225 Difference]: With dead ends: 369 [2018-10-15 12:28:19,409 INFO L226 Difference]: Without dead ends: 369 [2018-10-15 12:28:19,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:28:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-15 12:28:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2018-10-15 12:28:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-15 12:28:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-10-15 12:28:19,415 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 354 [2018-10-15 12:28:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:19,416 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-10-15 12:28:19,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:28:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-10-15 12:28:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-15 12:28:19,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:19,418 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:19,418 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:19,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1086082560, now seen corresponding path program 42 times [2018-10-15 12:28:19,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6930 backedges. 0 proven. 6930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:21,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:21,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:28:21,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:28:21,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:28:21,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:28:21,810 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 87 states. [2018-10-15 12:28:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:26,309 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-15 12:28:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:28:26,309 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 362 [2018-10-15 12:28:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:26,311 INFO L225 Difference]: With dead ends: 377 [2018-10-15 12:28:26,312 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 12:28:26,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:28:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 12:28:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 371. [2018-10-15 12:28:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 12:28:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-15 12:28:26,317 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 362 [2018-10-15 12:28:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:26,317 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-15 12:28:26,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:28:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-15 12:28:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-15 12:28:26,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:26,320 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:26,320 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:26,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1828568316, now seen corresponding path program 43 times [2018-10-15 12:28:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 0 proven. 7267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:28,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:28,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:28:28,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:28:28,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:28:28,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:28:28,762 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 89 states. [2018-10-15 12:28:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:33,065 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-10-15 12:28:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:28:33,065 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 370 [2018-10-15 12:28:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:33,067 INFO L225 Difference]: With dead ends: 385 [2018-10-15 12:28:33,067 INFO L226 Difference]: Without dead ends: 385 [2018-10-15 12:28:33,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:28:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-15 12:28:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 379. [2018-10-15 12:28:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-15 12:28:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-10-15 12:28:33,073 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 370 [2018-10-15 12:28:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:33,074 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-10-15 12:28:33,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:28:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-10-15 12:28:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-15 12:28:33,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:33,076 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:33,076 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:33,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -592343032, now seen corresponding path program 44 times [2018-10-15 12:28:33,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7612 backedges. 0 proven. 7612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:35,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:35,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:28:35,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:28:35,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:28:35,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:28:35,855 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 91 states. [2018-10-15 12:28:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:40,371 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-15 12:28:40,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:28:40,372 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 378 [2018-10-15 12:28:40,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:40,373 INFO L225 Difference]: With dead ends: 393 [2018-10-15 12:28:40,373 INFO L226 Difference]: Without dead ends: 393 [2018-10-15 12:28:40,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:28:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-15 12:28:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 387. [2018-10-15 12:28:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-15 12:28:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-10-15 12:28:40,378 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 378 [2018-10-15 12:28:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:40,379 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-10-15 12:28:40,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:28:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-10-15 12:28:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-15 12:28:40,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:40,381 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:40,381 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:40,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:40,382 INFO L82 PathProgramCache]: Analyzing trace with hash -304768756, now seen corresponding path program 45 times [2018-10-15 12:28:40,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7965 backedges. 0 proven. 7965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:42,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:42,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:28:42,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:28:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:28:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:28:42,899 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 93 states. [2018-10-15 12:28:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:47,605 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-15 12:28:47,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:28:47,606 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 386 [2018-10-15 12:28:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:47,607 INFO L225 Difference]: With dead ends: 401 [2018-10-15 12:28:47,607 INFO L226 Difference]: Without dead ends: 401 [2018-10-15 12:28:47,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:28:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-15 12:28:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 395. [2018-10-15 12:28:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-15 12:28:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-15 12:28:47,613 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 386 [2018-10-15 12:28:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:47,614 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-15 12:28:47,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:28:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-15 12:28:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-15 12:28:47,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:47,616 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:47,616 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:47,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1408392720, now seen corresponding path program 46 times [2018-10-15 12:28:47,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8326 backedges. 0 proven. 8326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:50,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:50,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:28:50,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:28:50,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:28:50,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:28:50,622 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 95 states. [2018-10-15 12:28:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:55,926 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-10-15 12:28:55,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:28:55,927 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 394 [2018-10-15 12:28:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:55,929 INFO L225 Difference]: With dead ends: 409 [2018-10-15 12:28:55,929 INFO L226 Difference]: Without dead ends: 409 [2018-10-15 12:28:55,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:28:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-15 12:28:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2018-10-15 12:28:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 12:28:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-15 12:28:55,934 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 394 [2018-10-15 12:28:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:55,934 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-15 12:28:55,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:28:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-15 12:28:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 12:28:55,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:55,936 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:55,936 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:55,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash -661922028, now seen corresponding path program 47 times [2018-10-15 12:28:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8695 backedges. 0 proven. 8695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:58,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:58,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:28:58,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:28:58,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:28:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:28:58,699 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 97 states. [2018-10-15 12:29:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:03,874 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-10-15 12:29:03,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:29:03,874 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 402 [2018-10-15 12:29:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:03,876 INFO L225 Difference]: With dead ends: 417 [2018-10-15 12:29:03,876 INFO L226 Difference]: Without dead ends: 417 [2018-10-15 12:29:03,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:29:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-15 12:29:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 411. [2018-10-15 12:29:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-15 12:29:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-10-15 12:29:03,882 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 402 [2018-10-15 12:29:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:03,882 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-10-15 12:29:03,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:29:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-10-15 12:29:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-15 12:29:03,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:03,884 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:03,885 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:03,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2128208872, now seen corresponding path program 48 times [2018-10-15 12:29:03,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9072 backedges. 0 proven. 9072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:07,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:07,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:29:07,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:29:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:29:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:29:07,201 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 99 states. [2018-10-15 12:29:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:12,521 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-15 12:29:12,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:29:12,521 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 410 [2018-10-15 12:29:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:12,523 INFO L225 Difference]: With dead ends: 425 [2018-10-15 12:29:12,523 INFO L226 Difference]: Without dead ends: 425 [2018-10-15 12:29:12,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:29:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-15 12:29:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 419. [2018-10-15 12:29:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-15 12:29:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2018-10-15 12:29:12,529 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 410 [2018-10-15 12:29:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:12,530 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2018-10-15 12:29:12,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:29:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2018-10-15 12:29:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-15 12:29:12,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:12,533 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:12,533 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:12,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1891298020, now seen corresponding path program 49 times [2018-10-15 12:29:12,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9457 backedges. 0 proven. 9457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:15,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:15,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:29:15,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:29:15,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:29:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:29:15,808 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 101 states. [2018-10-15 12:29:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:21,297 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-10-15 12:29:21,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:29:21,297 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 418 [2018-10-15 12:29:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:21,299 INFO L225 Difference]: With dead ends: 433 [2018-10-15 12:29:21,299 INFO L226 Difference]: Without dead ends: 433 [2018-10-15 12:29:21,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:29:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-15 12:29:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2018-10-15 12:29:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-15 12:29:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-10-15 12:29:21,305 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 418 [2018-10-15 12:29:21,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:21,306 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-10-15 12:29:21,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:29:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-10-15 12:29:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-15 12:29:21,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:21,309 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:21,309 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:21,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:21,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2140354016, now seen corresponding path program 50 times [2018-10-15 12:29:21,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9850 backedges. 0 proven. 9850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:24,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:24,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:29:24,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:29:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:29:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:29:24,528 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 103 states. [2018-10-15 12:29:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:30,192 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-10-15 12:29:30,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:29:30,192 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 426 [2018-10-15 12:29:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:30,195 INFO L225 Difference]: With dead ends: 441 [2018-10-15 12:29:30,195 INFO L226 Difference]: Without dead ends: 441 [2018-10-15 12:29:30,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:29:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-15 12:29:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 435. [2018-10-15 12:29:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-15 12:29:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-10-15 12:29:30,200 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 426 [2018-10-15 12:29:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:30,201 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-10-15 12:29:30,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:29:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-10-15 12:29:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-15 12:29:30,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:30,204 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:30,204 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:30,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:30,205 INFO L82 PathProgramCache]: Analyzing trace with hash 237058852, now seen corresponding path program 51 times [2018-10-15 12:29:30,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10251 backedges. 0 proven. 10251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:33,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:33,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:29:33,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:29:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:29:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:29:33,619 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 105 states. [2018-10-15 12:29:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:39,572 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-15 12:29:39,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:29:39,573 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 434 [2018-10-15 12:29:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:39,574 INFO L225 Difference]: With dead ends: 449 [2018-10-15 12:29:39,574 INFO L226 Difference]: Without dead ends: 449 [2018-10-15 12:29:39,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:29:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-15 12:29:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 443. [2018-10-15 12:29:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-15 12:29:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-15 12:29:39,580 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 434 [2018-10-15 12:29:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:39,580 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-15 12:29:39,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:29:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-15 12:29:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-15 12:29:39,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:39,582 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:39,582 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:39,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash 770074664, now seen corresponding path program 52 times [2018-10-15 12:29:39,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:43,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:43,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:29:43,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:29:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:29:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:29:43,715 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 107 states. [2018-10-15 12:29:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:49,855 INFO L93 Difference]: Finished difference Result 457 states and 457 transitions. [2018-10-15 12:29:49,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:29:49,856 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 442 [2018-10-15 12:29:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:49,858 INFO L225 Difference]: With dead ends: 457 [2018-10-15 12:29:49,858 INFO L226 Difference]: Without dead ends: 457 [2018-10-15 12:29:49,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:29:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-15 12:29:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 451. [2018-10-15 12:29:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-15 12:29:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-15 12:29:49,863 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 442 [2018-10-15 12:29:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:49,863 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-15 12:29:49,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:29:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-15 12:29:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-15 12:29:49,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:49,865 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:49,865 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:49,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:49,865 INFO L82 PathProgramCache]: Analyzing trace with hash 289427756, now seen corresponding path program 53 times [2018-10-15 12:29:49,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 11077 backedges. 0 proven. 11077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:53,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:53,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:29:53,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:29:53,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:29:53,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:29:53,524 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 109 states. [2018-10-15 12:29:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:59,846 INFO L93 Difference]: Finished difference Result 465 states and 465 transitions. [2018-10-15 12:29:59,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:29:59,846 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 450 [2018-10-15 12:29:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:59,848 INFO L225 Difference]: With dead ends: 465 [2018-10-15 12:29:59,848 INFO L226 Difference]: Without dead ends: 465 [2018-10-15 12:29:59,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:29:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-10-15 12:29:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2018-10-15 12:29:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-15 12:29:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2018-10-15 12:29:59,852 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 450 [2018-10-15 12:29:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:59,853 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 459 transitions. [2018-10-15 12:29:59,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:29:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 459 transitions. [2018-10-15 12:29:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-15 12:29:59,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:59,855 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:59,855 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:59,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash 632485424, now seen corresponding path program 54 times [2018-10-15 12:29:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11502 backedges. 0 proven. 11502 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:03,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:03,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:30:03,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:30:03,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:30:03,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:30:03,725 INFO L87 Difference]: Start difference. First operand 459 states and 459 transitions. Second operand 111 states. [2018-10-15 12:30:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:10,107 INFO L93 Difference]: Finished difference Result 473 states and 473 transitions. [2018-10-15 12:30:10,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:30:10,107 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 458 [2018-10-15 12:30:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:10,109 INFO L225 Difference]: With dead ends: 473 [2018-10-15 12:30:10,109 INFO L226 Difference]: Without dead ends: 473 [2018-10-15 12:30:10,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:30:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-10-15 12:30:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 467. [2018-10-15 12:30:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 12:30:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 467 transitions. [2018-10-15 12:30:10,115 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 467 transitions. Word has length 458 [2018-10-15 12:30:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:10,115 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 467 transitions. [2018-10-15 12:30:10,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:30:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 467 transitions. [2018-10-15 12:30:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-15 12:30:10,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:10,117 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:10,117 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:10,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash 348280628, now seen corresponding path program 55 times [2018-10-15 12:30:10,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:14,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:14,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:30:14,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:30:14,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:30:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:30:14,011 INFO L87 Difference]: Start difference. First operand 467 states and 467 transitions. Second operand 113 states. [2018-10-15 12:30:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:20,681 INFO L93 Difference]: Finished difference Result 481 states and 481 transitions. [2018-10-15 12:30:20,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:30:20,681 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 466 [2018-10-15 12:30:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:20,683 INFO L225 Difference]: With dead ends: 481 [2018-10-15 12:30:20,683 INFO L226 Difference]: Without dead ends: 481 [2018-10-15 12:30:20,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:30:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-10-15 12:30:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2018-10-15 12:30:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-15 12:30:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 475 transitions. [2018-10-15 12:30:20,688 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 475 transitions. Word has length 466 [2018-10-15 12:30:20,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:20,689 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 475 transitions. [2018-10-15 12:30:20,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:30:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 475 transitions. [2018-10-15 12:30:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-15 12:30:20,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:20,691 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:20,691 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:20,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1007520712, now seen corresponding path program 56 times [2018-10-15 12:30:20,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:24,823 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-15 12:30:24,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:24,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:30:24,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:30:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:30:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:30:24,825 INFO L87 Difference]: Start difference. First operand 475 states and 475 transitions. Second operand 115 states. [2018-10-15 12:30:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:31,904 INFO L93 Difference]: Finished difference Result 489 states and 489 transitions. [2018-10-15 12:30:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:30:31,904 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 474 [2018-10-15 12:30:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:31,906 INFO L225 Difference]: With dead ends: 489 [2018-10-15 12:30:31,906 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 12:30:31,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:30:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 12:30:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 483. [2018-10-15 12:30:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-15 12:30:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 483 transitions. [2018-10-15 12:30:31,913 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 483 transitions. Word has length 474 [2018-10-15 12:30:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:31,913 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 483 transitions. [2018-10-15 12:30:31,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:30:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 483 transitions. [2018-10-15 12:30:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-10-15 12:30:31,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:31,915 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:31,915 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:31,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1422347580, now seen corresponding path program 57 times [2018-10-15 12:30:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12825 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:35,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:35,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:30:35,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:30:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:30:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:30:35,895 INFO L87 Difference]: Start difference. First operand 483 states and 483 transitions. Second operand 117 states. [2018-10-15 12:30:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:43,311 INFO L93 Difference]: Finished difference Result 497 states and 497 transitions. [2018-10-15 12:30:43,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:30:43,311 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 482 [2018-10-15 12:30:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:43,313 INFO L225 Difference]: With dead ends: 497 [2018-10-15 12:30:43,313 INFO L226 Difference]: Without dead ends: 497 [2018-10-15 12:30:43,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:30:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-10-15 12:30:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 491. [2018-10-15 12:30:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-10-15 12:30:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 491 transitions. [2018-10-15 12:30:43,318 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 491 transitions. Word has length 482 [2018-10-15 12:30:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:43,319 INFO L481 AbstractCegarLoop]: Abstraction has 491 states and 491 transitions. [2018-10-15 12:30:43,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:30:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 491 transitions. [2018-10-15 12:30:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-10-15 12:30:43,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:43,321 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:43,321 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:43,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:43,321 INFO L82 PathProgramCache]: Analyzing trace with hash 616882752, now seen corresponding path program 58 times [2018-10-15 12:30:43,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13282 backedges. 0 proven. 13282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:47,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:47,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:30:47,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:30:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:30:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:30:47,524 INFO L87 Difference]: Start difference. First operand 491 states and 491 transitions. Second operand 119 states. [2018-10-15 12:30:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:55,022 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-15 12:30:55,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 12:30:55,023 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 490 [2018-10-15 12:30:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:55,025 INFO L225 Difference]: With dead ends: 505 [2018-10-15 12:30:55,025 INFO L226 Difference]: Without dead ends: 505 [2018-10-15 12:30:55,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:30:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-15 12:30:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 499. [2018-10-15 12:30:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-15 12:30:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 499 transitions. [2018-10-15 12:30:55,030 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 499 transitions. Word has length 490 [2018-10-15 12:30:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:55,031 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 499 transitions. [2018-10-15 12:30:55,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:30:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 499 transitions. [2018-10-15 12:30:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-10-15 12:30:55,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:55,033 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:55,033 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:55,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash -848350396, now seen corresponding path program 59 times [2018-10-15 12:30:55,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13747 backedges. 0 proven. 13747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:59,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:59,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:30:59,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:30:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:30:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:30:59,509 INFO L87 Difference]: Start difference. First operand 499 states and 499 transitions. Second operand 121 states. [2018-10-15 12:31:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:07,104 INFO L93 Difference]: Finished difference Result 513 states and 513 transitions. [2018-10-15 12:31:07,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 12:31:07,104 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 498 [2018-10-15 12:31:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:07,106 INFO L225 Difference]: With dead ends: 513 [2018-10-15 12:31:07,106 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 12:31:07,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 12:31:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 12:31:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 507. [2018-10-15 12:31:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-15 12:31:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-15 12:31:07,110 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 498 [2018-10-15 12:31:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:07,111 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-15 12:31:07,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 12:31:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-15 12:31:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-15 12:31:07,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:07,113 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:07,113 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:07,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash 608845896, now seen corresponding path program 60 times [2018-10-15 12:31:07,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14220 backedges. 0 proven. 14220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:11,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:11,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:31:11,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:31:11,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:31:11,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:31:11,835 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 123 states. [2018-10-15 12:31:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:19,914 INFO L93 Difference]: Finished difference Result 521 states and 521 transitions. [2018-10-15 12:31:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 12:31:19,914 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 506 [2018-10-15 12:31:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:19,916 INFO L225 Difference]: With dead ends: 521 [2018-10-15 12:31:19,916 INFO L226 Difference]: Without dead ends: 521 [2018-10-15 12:31:19,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 12:31:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-10-15 12:31:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 515. [2018-10-15 12:31:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 12:31:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-15 12:31:19,922 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 506 [2018-10-15 12:31:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:19,922 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-15 12:31:19,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:31:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-15 12:31:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-15 12:31:19,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:19,924 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:19,925 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:19,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash 987367756, now seen corresponding path program 61 times [2018-10-15 12:31:19,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14701 backedges. 0 proven. 14701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:24,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:24,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 12:31:24,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 12:31:24,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 12:31:24,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:31:24,661 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 125 states. [2018-10-15 12:31:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:32,631 INFO L93 Difference]: Finished difference Result 529 states and 529 transitions. [2018-10-15 12:31:32,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 12:31:32,631 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 514 [2018-10-15 12:31:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:32,633 INFO L225 Difference]: With dead ends: 529 [2018-10-15 12:31:32,633 INFO L226 Difference]: Without dead ends: 529 [2018-10-15 12:31:32,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 12:31:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-10-15 12:31:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 523. [2018-10-15 12:31:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-15 12:31:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 523 transitions. [2018-10-15 12:31:32,638 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 523 transitions. Word has length 514 [2018-10-15 12:31:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:32,639 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 523 transitions. [2018-10-15 12:31:32,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 12:31:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 523 transitions. [2018-10-15 12:31:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-10-15 12:31:32,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:32,641 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:32,641 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:32,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1587711568, now seen corresponding path program 62 times [2018-10-15 12:31:32,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15190 backedges. 0 proven. 15190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:37,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:37,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 12:31:37,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 12:31:37,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 12:31:37,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:31:37,547 INFO L87 Difference]: Start difference. First operand 523 states and 523 transitions. Second operand 127 states. [2018-10-15 12:31:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:46,003 INFO L93 Difference]: Finished difference Result 537 states and 537 transitions. [2018-10-15 12:31:46,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 12:31:46,003 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 522 [2018-10-15 12:31:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:46,005 INFO L225 Difference]: With dead ends: 537 [2018-10-15 12:31:46,005 INFO L226 Difference]: Without dead ends: 537 [2018-10-15 12:31:46,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 12:31:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-15 12:31:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2018-10-15 12:31:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-10-15 12:31:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 531 transitions. [2018-10-15 12:31:46,012 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 531 transitions. Word has length 522 [2018-10-15 12:31:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:46,012 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 531 transitions. [2018-10-15 12:31:46,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 12:31:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 531 transitions. [2018-10-15 12:31:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-15 12:31:46,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:46,015 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:46,015 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:46,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash 422039380, now seen corresponding path program 63 times [2018-10-15 12:31:46,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15687 backedges. 0 proven. 15687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 12:31:51,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 12:31:51,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 12:31:51,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:31:51,065 INFO L87 Difference]: Start difference. First operand 531 states and 531 transitions. Second operand 129 states. [2018-10-15 12:31:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:59,911 INFO L93 Difference]: Finished difference Result 545 states and 545 transitions. [2018-10-15 12:31:59,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 12:31:59,911 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 530 [2018-10-15 12:31:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:59,913 INFO L225 Difference]: With dead ends: 545 [2018-10-15 12:31:59,913 INFO L226 Difference]: Without dead ends: 545 [2018-10-15 12:31:59,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 12:31:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-15 12:31:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 539. [2018-10-15 12:31:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-15 12:31:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 539 transitions. [2018-10-15 12:31:59,920 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 539 transitions. Word has length 530 [2018-10-15 12:31:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:59,920 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 539 transitions. [2018-10-15 12:31:59,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 12:31:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 539 transitions. [2018-10-15 12:31:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-15 12:31:59,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:59,923 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:59,924 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:59,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash 804113496, now seen corresponding path program 64 times [2018-10-15 12:31:59,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16192 backedges. 0 proven. 16192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:05,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:05,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 12:32:05,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 12:32:05,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 12:32:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:32:05,106 INFO L87 Difference]: Start difference. First operand 539 states and 539 transitions. Second operand 131 states. [2018-10-15 12:32:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:13,845 INFO L93 Difference]: Finished difference Result 553 states and 553 transitions. [2018-10-15 12:32:13,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 12:32:13,845 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 538 [2018-10-15 12:32:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:13,847 INFO L225 Difference]: With dead ends: 553 [2018-10-15 12:32:13,847 INFO L226 Difference]: Without dead ends: 553 [2018-10-15 12:32:13,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 12:32:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-10-15 12:32:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 547. [2018-10-15 12:32:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-15 12:32:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 547 transitions. [2018-10-15 12:32:13,853 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 547 transitions. Word has length 538 [2018-10-15 12:32:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:13,854 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 547 transitions. [2018-10-15 12:32:13,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 12:32:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 547 transitions. [2018-10-15 12:32:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-10-15 12:32:13,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:13,856 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:13,856 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:13,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1535605412, now seen corresponding path program 65 times [2018-10-15 12:32:13,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 16705 backedges. 0 proven. 16705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:18,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:18,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:32:18,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:32:18,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:32:18,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:32:18,995 INFO L87 Difference]: Start difference. First operand 547 states and 547 transitions. Second operand 133 states. [2018-10-15 12:32:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:28,350 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-15 12:32:28,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 12:32:28,350 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 546 [2018-10-15 12:32:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:28,352 INFO L225 Difference]: With dead ends: 561 [2018-10-15 12:32:28,352 INFO L226 Difference]: Without dead ends: 561 [2018-10-15 12:32:28,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:32:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-15 12:32:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 555. [2018-10-15 12:32:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-15 12:32:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 555 transitions. [2018-10-15 12:32:28,358 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 555 transitions. Word has length 546 [2018-10-15 12:32:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:28,358 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 555 transitions. [2018-10-15 12:32:28,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:32:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 555 transitions. [2018-10-15 12:32:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2018-10-15 12:32:28,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:28,361 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:28,361 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:28,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1270089120, now seen corresponding path program 66 times [2018-10-15 12:32:28,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17226 backedges. 0 proven. 17226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:33,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:33,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 12:32:33,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 12:32:33,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 12:32:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:32:33,829 INFO L87 Difference]: Start difference. First operand 555 states and 555 transitions. Second operand 135 states. [2018-10-15 12:32:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:43,362 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2018-10-15 12:32:43,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 12:32:43,362 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 554 [2018-10-15 12:32:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:43,364 INFO L225 Difference]: With dead ends: 569 [2018-10-15 12:32:43,364 INFO L226 Difference]: Without dead ends: 569 [2018-10-15 12:32:43,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 12:32:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-10-15 12:32:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 563. [2018-10-15 12:32:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-15 12:32:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-15 12:32:43,371 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 554 [2018-10-15 12:32:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:43,372 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-15 12:32:43,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 12:32:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-15 12:32:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-15 12:32:43,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:43,375 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:43,376 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:43,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash -655611036, now seen corresponding path program 67 times [2018-10-15 12:32:43,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17755 backedges. 0 proven. 17755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:48,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:48,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 12:32:48,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 12:32:48,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 12:32:48,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:32:48,941 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 137 states. [2018-10-15 12:32:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:58,694 INFO L93 Difference]: Finished difference Result 577 states and 577 transitions. [2018-10-15 12:32:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 12:32:58,695 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 562 [2018-10-15 12:32:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:58,697 INFO L225 Difference]: With dead ends: 577 [2018-10-15 12:32:58,697 INFO L226 Difference]: Without dead ends: 577 [2018-10-15 12:32:58,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 12:32:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-15 12:32:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 571. [2018-10-15 12:32:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-10-15 12:32:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 571 transitions. [2018-10-15 12:32:58,703 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 571 transitions. Word has length 562 [2018-10-15 12:32:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:58,703 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 571 transitions. [2018-10-15 12:32:58,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 12:32:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 571 transitions. [2018-10-15 12:32:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-15 12:32:58,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:58,706 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:58,706 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:58,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:58,706 INFO L82 PathProgramCache]: Analyzing trace with hash -941811608, now seen corresponding path program 68 times [2018-10-15 12:32:58,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18292 backedges. 0 proven. 18292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:04,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:04,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 12:33:04,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 12:33:04,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 12:33:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:33:04,525 INFO L87 Difference]: Start difference. First operand 571 states and 571 transitions. Second operand 139 states. [2018-10-15 12:33:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:14,671 INFO L93 Difference]: Finished difference Result 585 states and 585 transitions. [2018-10-15 12:33:14,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 12:33:14,671 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 570 [2018-10-15 12:33:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:14,673 INFO L225 Difference]: With dead ends: 585 [2018-10-15 12:33:14,673 INFO L226 Difference]: Without dead ends: 585 [2018-10-15 12:33:14,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 12:33:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-10-15 12:33:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2018-10-15 12:33:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-15 12:33:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 579 transitions. [2018-10-15 12:33:14,678 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 579 transitions. Word has length 570 [2018-10-15 12:33:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:14,679 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 579 transitions. [2018-10-15 12:33:14,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 12:33:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 579 transitions. [2018-10-15 12:33:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2018-10-15 12:33:14,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:14,681 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:14,682 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:14,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:14,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1923268972, now seen corresponding path program 69 times [2018-10-15 12:33:14,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18837 backedges. 0 proven. 18837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:20,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:20,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 12:33:20,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 12:33:20,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 12:33:20,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 12:33:20,643 INFO L87 Difference]: Start difference. First operand 579 states and 579 transitions. Second operand 141 states. [2018-10-15 12:33:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:31,090 INFO L93 Difference]: Finished difference Result 593 states and 593 transitions. [2018-10-15 12:33:31,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 12:33:31,090 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 578 [2018-10-15 12:33:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:31,092 INFO L225 Difference]: With dead ends: 593 [2018-10-15 12:33:31,092 INFO L226 Difference]: Without dead ends: 593 [2018-10-15 12:33:31,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 12:33:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-10-15 12:33:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2018-10-15 12:33:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-10-15 12:33:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 587 transitions. [2018-10-15 12:33:31,098 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 587 transitions. Word has length 578 [2018-10-15 12:33:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:31,099 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 587 transitions. [2018-10-15 12:33:31,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 12:33:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 587 transitions. [2018-10-15 12:33:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-10-15 12:33:31,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:31,102 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:31,102 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:31,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 113321584, now seen corresponding path program 70 times [2018-10-15 12:33:31,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19390 backedges. 0 proven. 19390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:37,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:37,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 12:33:37,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 12:33:37,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 12:33:37,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:33:37,248 INFO L87 Difference]: Start difference. First operand 587 states and 587 transitions. Second operand 143 states. [2018-10-15 12:33:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:47,821 INFO L93 Difference]: Finished difference Result 601 states and 601 transitions. [2018-10-15 12:33:47,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 12:33:47,821 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 586 [2018-10-15 12:33:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:47,823 INFO L225 Difference]: With dead ends: 601 [2018-10-15 12:33:47,823 INFO L226 Difference]: Without dead ends: 601 [2018-10-15 12:33:47,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 12:33:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-10-15 12:33:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 595. [2018-10-15 12:33:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-10-15 12:33:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 595 transitions. [2018-10-15 12:33:47,829 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 595 transitions. Word has length 586 [2018-10-15 12:33:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:47,829 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 595 transitions. [2018-10-15 12:33:47,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 12:33:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 595 transitions. [2018-10-15 12:33:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2018-10-15 12:33:47,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:47,832 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:47,832 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:47,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash -306428044, now seen corresponding path program 71 times [2018-10-15 12:33:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 19951 backedges. 0 proven. 19951 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:54,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:54,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 12:33:54,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 12:33:54,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 12:33:54,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 12:33:54,065 INFO L87 Difference]: Start difference. First operand 595 states and 595 transitions. Second operand 145 states. [2018-10-15 12:34:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:04,848 INFO L93 Difference]: Finished difference Result 609 states and 609 transitions. [2018-10-15 12:34:04,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 12:34:04,848 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 594 [2018-10-15 12:34:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:04,850 INFO L225 Difference]: With dead ends: 609 [2018-10-15 12:34:04,850 INFO L226 Difference]: Without dead ends: 609 [2018-10-15 12:34:04,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 12:34:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-10-15 12:34:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 603. [2018-10-15 12:34:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-15 12:34:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 603 transitions. [2018-10-15 12:34:04,857 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 603 transitions. Word has length 594 [2018-10-15 12:34:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:04,857 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 603 transitions. [2018-10-15 12:34:04,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 12:34:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 603 transitions. [2018-10-15 12:34:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-15 12:34:04,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:04,860 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:04,861 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:04,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:04,861 INFO L82 PathProgramCache]: Analyzing trace with hash -854055816, now seen corresponding path program 72 times [2018-10-15 12:34:04,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20520 backedges. 0 proven. 20520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:11,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:11,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 12:34:11,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 12:34:11,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 12:34:11,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:34:11,220 INFO L87 Difference]: Start difference. First operand 603 states and 603 transitions. Second operand 147 states. [2018-10-15 12:34:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:22,649 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-15 12:34:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 12:34:22,649 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 602 [2018-10-15 12:34:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:22,651 INFO L225 Difference]: With dead ends: 617 [2018-10-15 12:34:22,651 INFO L226 Difference]: Without dead ends: 617 [2018-10-15 12:34:22,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 12:34:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-15 12:34:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2018-10-15 12:34:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-10-15 12:34:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 611 transitions. [2018-10-15 12:34:22,657 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 611 transitions. Word has length 602 [2018-10-15 12:34:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:22,657 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 611 transitions. [2018-10-15 12:34:22,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 12:34:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 611 transitions. [2018-10-15 12:34:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-10-15 12:34:22,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:22,660 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:22,660 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:22,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:22,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2041004676, now seen corresponding path program 73 times [2018-10-15 12:34:22,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 21097 backedges. 0 proven. 21097 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:29,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:29,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 12:34:29,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 12:34:29,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 12:34:29,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 12:34:29,536 INFO L87 Difference]: Start difference. First operand 611 states and 611 transitions. Second operand 149 states. [2018-10-15 12:34:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:41,205 INFO L93 Difference]: Finished difference Result 625 states and 625 transitions. [2018-10-15 12:34:41,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-10-15 12:34:41,206 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 610 [2018-10-15 12:34:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:41,209 INFO L225 Difference]: With dead ends: 625 [2018-10-15 12:34:41,209 INFO L226 Difference]: Without dead ends: 625 [2018-10-15 12:34:41,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15841 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=27378, Invalid=59352, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 12:34:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-15 12:34:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 619. [2018-10-15 12:34:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-15 12:34:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 619 transitions. [2018-10-15 12:34:41,216 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 619 transitions. Word has length 610 [2018-10-15 12:34:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:41,216 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 619 transitions. [2018-10-15 12:34:41,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 12:34:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 619 transitions. [2018-10-15 12:34:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-15 12:34:41,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:41,219 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:41,219 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:41,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash 922882688, now seen corresponding path program 74 times [2018-10-15 12:34:41,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat