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/diamond_true-unreach-call1_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:34:47,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:34:47,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:34:47,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:34:47,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:34:47,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:34:47,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:34:47,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:34:47,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:34:47,332 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:34:47,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:34:47,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:34:47,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:34:47,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:34:47,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:34:47,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:34:47,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:34:47,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:34:47,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:34:47,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:34:47,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:34:47,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:34:47,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:34:47,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:34:47,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:34:47,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:34:47,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:34:47,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:34:47,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:34:47,354 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:34:47,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:34:47,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:34:47,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:34:47,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:34:47,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:34:47,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:34:47,361 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:34:47,379 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:34:47,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:34:47,380 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:34:47,380 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:34:47,380 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:34:47,381 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:34:47,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:34:47,381 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:34:47,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:34:47,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:34:47,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:34:47,385 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:34:47,385 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:34:47,386 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:34:47,387 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:34:47,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:34:47,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:34:47,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:34:47,483 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:34:47,483 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:34:47,484 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call1_true-termination.i_4.bpl [2018-10-15 12:34:47,485 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call1_true-termination.i_4.bpl' [2018-10-15 12:34:47,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:34:47,568 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:34:47,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:34:47,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:34:47,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:34:47,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (1/1) ... [2018-10-15 12:34:47,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (1/1) ... [2018-10-15 12:34:47,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (1/1) ... [2018-10-15 12:34:47,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (1/1) ... [2018-10-15 12:34:47,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (1/1) ... [2018-10-15 12:34:47,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (1/1) ... [2018-10-15 12:34:47,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (1/1) ... [2018-10-15 12:34:47,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:34:47,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:34:47,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:34:47,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:34:47,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (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:34:47,711 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:34:47,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:34:47,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:34:48,044 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:34:48,045 INFO L202 PluginConnector]: Adding new model diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:34:48 BoogieIcfgContainer [2018-10-15 12:34:48,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:34:48,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:34:48,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:34:48,050 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:34:48,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:47" (1/2) ... [2018-10-15 12:34:48,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6aaf4b and model type diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:34:48, skipping insertion in model container [2018-10-15 12:34:48,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call1_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:34:48" (2/2) ... [2018-10-15 12:34:48,054 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call1_true-termination.i_4.bpl [2018-10-15 12:34:48,064 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:34:48,072 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:34:48,091 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:34:48,121 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:34:48,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:34:48,122 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:34:48,122 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:34:48,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:34:48,122 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:34:48,123 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:34:48,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:34:48,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:34:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-15 12:34:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 12:34:48,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:48,149 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:48,150 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:48,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1240084206, now seen corresponding path program 1 times [2018-10-15 12:34:48,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:48,500 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:34:48,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:34:48,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:34:48,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:34:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:34:48,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:34:48,526 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-15 12:34:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:48,626 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-15 12:34:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:34:48,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 12:34:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:48,639 INFO L225 Difference]: With dead ends: 21 [2018-10-15 12:34:48,639 INFO L226 Difference]: Without dead ends: 21 [2018-10-15 12:34:48,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:34:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-15 12:34:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-15 12:34:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-15 12:34:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-15 12:34:48,679 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2018-10-15 12:34:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:48,679 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-15 12:34:48,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:34:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-15 12:34:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-15 12:34:48,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:48,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:48,681 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:48,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1365845986, now seen corresponding path program 1 times [2018-10-15 12:34:48,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:48,889 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:34:48,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:48,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:34:48,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:34:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:34:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:34:48,893 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-10-15 12:34:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:49,111 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-15 12:34:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:34:49,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-15 12:34:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:49,113 INFO L225 Difference]: With dead ends: 26 [2018-10-15 12:34:49,113 INFO L226 Difference]: Without dead ends: 26 [2018-10-15 12:34:49,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:34:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-15 12:34:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-10-15 12:34:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 12:34:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 12:34:49,119 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2018-10-15 12:34:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:49,119 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 12:34:49,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:34:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 12:34:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 12:34:49,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:49,121 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:49,121 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:49,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash -173305070, now seen corresponding path program 2 times [2018-10-15 12:34:49,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:49,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:49,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:34:49,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:34:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:34:49,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:34:49,503 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2018-10-15 12:34:49,702 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 12:34:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:49,840 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-15 12:34:49,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:34:49,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-15 12:34:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:49,843 INFO L225 Difference]: With dead ends: 31 [2018-10-15 12:34:49,843 INFO L226 Difference]: Without dead ends: 31 [2018-10-15 12:34:49,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:34:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-15 12:34:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-10-15 12:34:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-15 12:34:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-15 12:34:49,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2018-10-15 12:34:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:49,857 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-15 12:34:49,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:34:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-15 12:34:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-15 12:34:49,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:49,859 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:49,859 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:49,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1826839070, now seen corresponding path program 3 times [2018-10-15 12:34:49,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:50,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:50,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:34:50,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:34:50,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:34:50,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:34:50,349 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2018-10-15 12:34:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:51,019 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 12:34:51,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:34:51,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-10-15 12:34:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:51,021 INFO L225 Difference]: With dead ends: 36 [2018-10-15 12:34:51,022 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 12:34:51,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:34:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 12:34:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-10-15 12:34:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 12:34:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 12:34:51,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2018-10-15 12:34:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:51,028 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 12:34:51,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:34:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 12:34:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 12:34:51,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:51,030 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:51,030 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:51,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:51,031 INFO L82 PathProgramCache]: Analyzing trace with hash -831073006, now seen corresponding path program 4 times [2018-10-15 12:34:51,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:51,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:51,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:34:51,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:34:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:34:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:34:51,432 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2018-10-15 12:34:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:51,840 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 12:34:51,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:34:51,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-10-15 12:34:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:51,842 INFO L225 Difference]: With dead ends: 41 [2018-10-15 12:34:51,842 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 12:34:51,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:34:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 12:34:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-10-15 12:34:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 12:34:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 12:34:51,848 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-10-15 12:34:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:51,849 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 12:34:51,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:34:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 12:34:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:34:51,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:51,850 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:51,851 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:51,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:51,851 INFO L82 PathProgramCache]: Analyzing trace with hash 554345442, now seen corresponding path program 5 times [2018-10-15 12:34:51,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:52,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:52,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:34:52,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:34:52,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:34:52,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:34:52,398 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 13 states. [2018-10-15 12:34:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:53,087 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 12:34:53,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:34:53,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-10-15 12:34:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:53,089 INFO L225 Difference]: With dead ends: 46 [2018-10-15 12:34:53,090 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 12:34:53,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:34:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 12:34:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-10-15 12:34:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:34:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 12:34:53,097 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 37 [2018-10-15 12:34:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:53,098 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 12:34:53,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:34:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 12:34:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:34:53,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:53,101 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:53,101 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:53,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1536661266, now seen corresponding path program 6 times [2018-10-15 12:34:53,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:53,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:53,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:34:53,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:34:53,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:34:53,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:34:53,547 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 15 states. [2018-10-15 12:34:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:54,073 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-15 12:34:54,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:34:54,076 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-10-15 12:34:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:54,077 INFO L225 Difference]: With dead ends: 51 [2018-10-15 12:34:54,077 INFO L226 Difference]: Without dead ends: 51 [2018-10-15 12:34:54,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:34:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-15 12:34:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-10-15 12:34:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-15 12:34:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-15 12:34:54,083 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 42 [2018-10-15 12:34:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:54,083 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-15 12:34:54,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:34:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-15 12:34:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-15 12:34:54,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:54,085 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:54,085 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:54,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash -736943646, now seen corresponding path program 7 times [2018-10-15 12:34:54,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:54,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:54,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:34:54,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:34:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:34:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:34:54,733 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 17 states. [2018-10-15 12:34:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:55,512 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 12:34:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:34:55,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-10-15 12:34:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:55,515 INFO L225 Difference]: With dead ends: 56 [2018-10-15 12:34:55,515 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 12:34:55,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:34:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 12:34:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-10-15 12:34:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 12:34:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 12:34:55,522 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2018-10-15 12:34:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:55,522 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 12:34:55,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:34:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 12:34:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 12:34:55,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:55,524 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:55,524 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:55,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1345181970, now seen corresponding path program 8 times [2018-10-15 12:34:55,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:56,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:56,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:34:56,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:34:56,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:34:56,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:34:56,039 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 19 states. [2018-10-15 12:34:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:56,924 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-15 12:34:56,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:34:56,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-10-15 12:34:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:56,926 INFO L225 Difference]: With dead ends: 61 [2018-10-15 12:34:56,927 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 12:34:56,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:34:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 12:34:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-10-15 12:34:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 12:34:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-15 12:34:56,933 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 52 [2018-10-15 12:34:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:56,933 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-15 12:34:56,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:34:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-15 12:34:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 12:34:56,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:56,935 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:56,935 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:56,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:56,936 INFO L82 PathProgramCache]: Analyzing trace with hash -317317150, now seen corresponding path program 9 times [2018-10-15 12:34:56,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:57,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:57,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:34:57,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:34:57,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:34:57,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:34:57,381 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 21 states. [2018-10-15 12:34:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:58,412 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-15 12:34:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:34:58,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-10-15 12:34:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:58,415 INFO L225 Difference]: With dead ends: 66 [2018-10-15 12:34:58,415 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 12:34:58,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:34:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 12:34:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-10-15 12:34:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 12:34:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 12:34:58,422 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 57 [2018-10-15 12:34:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:58,422 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 12:34:58,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:34:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 12:34:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 12:34:58,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:58,424 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:58,424 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:58,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash -145122542, now seen corresponding path program 10 times [2018-10-15 12:34:58,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:58,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:58,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:34:58,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:34:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:34:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:34:58,822 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 23 states. [2018-10-15 12:35:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:00,462 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 12:35:00,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:35:00,463 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2018-10-15 12:35:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:00,464 INFO L225 Difference]: With dead ends: 71 [2018-10-15 12:35:00,464 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 12:35:00,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 12:35:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-10-15 12:35:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-15 12:35:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-15 12:35:00,470 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 62 [2018-10-15 12:35:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:00,470 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-15 12:35:00,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:35:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-15 12:35:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 12:35:00,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:00,472 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:00,472 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:00,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 351509986, now seen corresponding path program 11 times [2018-10-15 12:35:00,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:01,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:01,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:35:01,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:35:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:35:01,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:35:01,837 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-10-15 12:35:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:03,126 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 12:35:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:35:03,127 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-10-15 12:35:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:03,128 INFO L225 Difference]: With dead ends: 76 [2018-10-15 12:35:03,128 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 12:35:03,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:35:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 12:35:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-10-15 12:35:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 12:35:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 12:35:03,135 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 67 [2018-10-15 12:35:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:03,136 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 12:35:03,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:35:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 12:35:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:35:03,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:03,137 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:03,137 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:03,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:03,138 INFO L82 PathProgramCache]: Analyzing trace with hash 876272914, now seen corresponding path program 12 times [2018-10-15 12:35:03,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:03,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:03,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:35:03,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:35:03,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:35:03,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:35:03,802 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 27 states. [2018-10-15 12:35:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:05,117 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:35:05,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:35:05,118 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-10-15 12:35:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:05,119 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:35:05,119 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:35:05,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:35:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:35:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-10-15 12:35:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-15 12:35:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-15 12:35:05,125 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 72 [2018-10-15 12:35:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:05,126 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-15 12:35:05,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:35:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-15 12:35:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-15 12:35:05,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:05,127 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:05,127 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:05,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1552653282, now seen corresponding path program 13 times [2018-10-15 12:35:05,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:05,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:05,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:35:05,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:35:05,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:35:05,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:35:05,888 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 29 states. [2018-10-15 12:35:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:07,416 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-15 12:35:07,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:35:07,417 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2018-10-15 12:35:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:07,418 INFO L225 Difference]: With dead ends: 86 [2018-10-15 12:35:07,418 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 12:35:07,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:35:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 12:35:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-10-15 12:35:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:35:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:35:07,425 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 77 [2018-10-15 12:35:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:07,425 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:35:07,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:35:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:35:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:35:07,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:07,427 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:07,427 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:07,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:07,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2114871534, now seen corresponding path program 14 times [2018-10-15 12:35:07,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:08,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:08,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:35:08,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:35:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:35:08,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:35:08,406 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 31 states. [2018-10-15 12:35:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:10,017 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-15 12:35:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:35:10,018 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 82 [2018-10-15 12:35:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:10,019 INFO L225 Difference]: With dead ends: 91 [2018-10-15 12:35:10,019 INFO L226 Difference]: Without dead ends: 91 [2018-10-15 12:35:10,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:35:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-15 12:35:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-10-15 12:35:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-15 12:35:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-15 12:35:10,026 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 82 [2018-10-15 12:35:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:10,027 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-15 12:35:10,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:35:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-15 12:35:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-15 12:35:10,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:10,028 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:10,029 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:10,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1019091426, now seen corresponding path program 15 times [2018-10-15 12:35:10,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:10,881 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:35:10,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:10,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:35:10,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:35:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:35:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:35:10,883 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 33 states. [2018-10-15 12:35:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:12,801 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-15 12:35:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:35:12,803 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-10-15 12:35:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:12,804 INFO L225 Difference]: With dead ends: 96 [2018-10-15 12:35:12,804 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 12:35:12,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:35:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 12:35:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-10-15 12:35:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 12:35:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 12:35:12,809 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 87 [2018-10-15 12:35:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:12,810 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 12:35:12,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:35:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 12:35:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 12:35:12,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:12,811 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:12,812 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:12,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash -207757038, now seen corresponding path program 16 times [2018-10-15 12:35:12,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:14,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:14,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:35:14,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:35:14,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:35:14,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:14,789 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 35 states. [2018-10-15 12:35:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:17,025 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-15 12:35:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:35:17,026 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 92 [2018-10-15 12:35:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:17,028 INFO L225 Difference]: With dead ends: 101 [2018-10-15 12:35:17,028 INFO L226 Difference]: Without dead ends: 101 [2018-10-15 12:35:17,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:35:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-15 12:35:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-10-15 12:35:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 12:35:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-15 12:35:17,032 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 92 [2018-10-15 12:35:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:17,033 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-15 12:35:17,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:35:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-15 12:35:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 12:35:17,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:17,036 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:17,036 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:17,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1771366430, now seen corresponding path program 17 times [2018-10-15 12:35:17,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:17,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:17,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:35:17,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:35:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:35:17,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:35:17,796 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 37 states. [2018-10-15 12:35:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:20,370 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 12:35:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:35:20,370 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-10-15 12:35:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:20,372 INFO L225 Difference]: With dead ends: 106 [2018-10-15 12:35:20,372 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 12:35:20,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:35:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 12:35:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-10-15 12:35:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 12:35:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 12:35:20,377 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 97 [2018-10-15 12:35:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:20,377 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 12:35:20,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:35:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 12:35:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 12:35:20,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:20,379 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:20,379 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:20,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash 878682898, now seen corresponding path program 18 times [2018-10-15 12:35:20,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:21,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:21,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:35:21,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:35:21,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:35:21,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:35:21,609 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 39 states. [2018-10-15 12:35:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:24,553 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-15 12:35:24,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:35:24,553 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-10-15 12:35:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:24,555 INFO L225 Difference]: With dead ends: 111 [2018-10-15 12:35:24,555 INFO L226 Difference]: Without dead ends: 111 [2018-10-15 12:35:24,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:35:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-15 12:35:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-10-15 12:35:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-15 12:35:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-15 12:35:24,560 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 102 [2018-10-15 12:35:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:24,560 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-15 12:35:24,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:35:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-15 12:35:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 12:35:24,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:24,561 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:24,561 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:24,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:24,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1301113374, now seen corresponding path program 19 times [2018-10-15 12:35:24,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:25,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:25,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:35:25,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:35:25,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:35:25,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:35:25,441 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 41 states. [2018-10-15 12:35:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:28,276 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-15 12:35:28,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:35:28,277 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 107 [2018-10-15 12:35:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:28,278 INFO L225 Difference]: With dead ends: 116 [2018-10-15 12:35:28,278 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 12:35:28,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:35:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 12:35:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2018-10-15 12:35:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 12:35:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-15 12:35:28,283 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 107 [2018-10-15 12:35:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:28,283 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-15 12:35:28,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:35:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-15 12:35:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 12:35:28,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:28,285 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:28,285 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:28,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:28,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2024348398, now seen corresponding path program 20 times [2018-10-15 12:35:28,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:30,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:30,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:35:30,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:35:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:35:30,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:30,213 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 43 states. [2018-10-15 12:35:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:33,304 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 12:35:33,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:35:33,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 112 [2018-10-15 12:35:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:33,307 INFO L225 Difference]: With dead ends: 121 [2018-10-15 12:35:33,307 INFO L226 Difference]: Without dead ends: 121 [2018-10-15 12:35:33,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:35:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-15 12:35:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-10-15 12:35:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-15 12:35:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-15 12:35:33,313 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 112 [2018-10-15 12:35:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:33,313 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-15 12:35:33,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:35:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-15 12:35:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-15 12:35:33,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:33,314 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:33,315 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:33,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1102353378, now seen corresponding path program 21 times [2018-10-15 12:35:33,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:35,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:35,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:35:35,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:35:35,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:35:35,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:35:35,289 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 45 states. [2018-10-15 12:35:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:38,786 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 12:35:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:35:38,789 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 117 [2018-10-15 12:35:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:38,790 INFO L225 Difference]: With dead ends: 126 [2018-10-15 12:35:38,790 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:35:38,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:35:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:35:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-10-15 12:35:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 12:35:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 12:35:38,794 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 117 [2018-10-15 12:35:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:38,794 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 12:35:38,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:35:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 12:35:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 12:35:38,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:38,795 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:38,795 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:38,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash -945576174, now seen corresponding path program 22 times [2018-10-15 12:35:38,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:41,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:41,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:35:41,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:35:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:35:41,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:35:41,103 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 47 states. [2018-10-15 12:35:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:45,066 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-15 12:35:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:35:45,067 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 122 [2018-10-15 12:35:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:45,068 INFO L225 Difference]: With dead ends: 131 [2018-10-15 12:35:45,068 INFO L226 Difference]: Without dead ends: 131 [2018-10-15 12:35:45,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:35:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-15 12:35:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2018-10-15 12:35:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 12:35:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 12:35:45,072 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 122 [2018-10-15 12:35:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:45,072 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 12:35:45,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:35:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 12:35:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:35:45,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:45,073 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:45,073 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:45,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1561399778, now seen corresponding path program 23 times [2018-10-15 12:35:45,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:46,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:46,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:35:46,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:35:46,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:35:46,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:35:46,475 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 49 states. [2018-10-15 12:35:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:50,617 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-15 12:35:50,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:35:50,618 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 127 [2018-10-15 12:35:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:50,619 INFO L225 Difference]: With dead ends: 136 [2018-10-15 12:35:50,619 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 12:35:50,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:35:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 12:35:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-10-15 12:35:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 12:35:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 12:35:50,623 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 127 [2018-10-15 12:35:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:50,623 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 12:35:50,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:35:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 12:35:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 12:35:50,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:50,624 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:50,625 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:50,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1751509266, now seen corresponding path program 24 times [2018-10-15 12:35:50,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:52,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:52,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:35:52,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:35:52,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:35:52,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:35:52,351 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 51 states. [2018-10-15 12:35:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:56,889 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-15 12:35:56,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:35:56,890 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 132 [2018-10-15 12:35:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:56,891 INFO L225 Difference]: With dead ends: 141 [2018-10-15 12:35:56,891 INFO L226 Difference]: Without dead ends: 141 [2018-10-15 12:35:56,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:35:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-15 12:35:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2018-10-15 12:35:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-15 12:35:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-15 12:35:56,896 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 132 [2018-10-15 12:35:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:56,896 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-15 12:35:56,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:35:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-15 12:35:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-15 12:35:56,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:56,898 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:56,898 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:56,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2056777758, now seen corresponding path program 25 times [2018-10-15 12:35:56,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:58,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:58,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:35:58,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:35:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:35:58,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:35:58,394 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 53 states. [2018-10-15 12:36:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:03,217 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-15 12:36:03,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:36:03,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 137 [2018-10-15 12:36:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:03,219 INFO L225 Difference]: With dead ends: 146 [2018-10-15 12:36:03,220 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 12:36:03,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:36:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 12:36:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-10-15 12:36:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 12:36:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 12:36:03,224 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 137 [2018-10-15 12:36:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:03,225 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 12:36:03,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:36:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 12:36:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:36:03,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:03,226 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:03,226 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:03,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:03,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1958587154, now seen corresponding path program 26 times [2018-10-15 12:36:03,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:05,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:05,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:36:05,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:36:05,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:36:05,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:36:05,412 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 55 states. [2018-10-15 12:36:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:10,581 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-15 12:36:10,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:36:10,581 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 142 [2018-10-15 12:36:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:10,583 INFO L225 Difference]: With dead ends: 151 [2018-10-15 12:36:10,583 INFO L226 Difference]: Without dead ends: 151 [2018-10-15 12:36:10,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:36:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-15 12:36:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-10-15 12:36:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-15 12:36:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-15 12:36:10,587 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 142 [2018-10-15 12:36:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:10,587 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-15 12:36:10,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:36:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-15 12:36:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-15 12:36:10,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:10,588 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:10,588 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:10,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1550217758, now seen corresponding path program 27 times [2018-10-15 12:36:10,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:12,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:12,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:36:12,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:36:12,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:36:12,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:36:12,250 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 57 states. [2018-10-15 12:36:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:17,786 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-15 12:36:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:36:17,786 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 147 [2018-10-15 12:36:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:17,788 INFO L225 Difference]: With dead ends: 156 [2018-10-15 12:36:17,788 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 12:36:17,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:36:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 12:36:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-10-15 12:36:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 12:36:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 12:36:17,792 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 147 [2018-10-15 12:36:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:17,792 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 12:36:17,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:36:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 12:36:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 12:36:17,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:17,793 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:17,793 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:17,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1882526446, now seen corresponding path program 28 times [2018-10-15 12:36:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:19,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:19,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:36:19,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:36:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:36:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:36:19,983 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 59 states. [2018-10-15 12:36:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:25,856 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-15 12:36:25,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:36:25,857 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 152 [2018-10-15 12:36:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:25,858 INFO L225 Difference]: With dead ends: 161 [2018-10-15 12:36:25,858 INFO L226 Difference]: Without dead ends: 161 [2018-10-15 12:36:25,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:36:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-15 12:36:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2018-10-15 12:36:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 12:36:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-15 12:36:25,863 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 152 [2018-10-15 12:36:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:25,864 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-15 12:36:25,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:36:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-15 12:36:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 12:36:25,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:25,865 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:25,865 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:25,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash 142969826, now seen corresponding path program 29 times [2018-10-15 12:36:25,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:27,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:27,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:36:27,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:36:27,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:36:27,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:36:27,765 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 61 states. [2018-10-15 12:36:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:34,064 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 12:36:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:36:34,064 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 157 [2018-10-15 12:36:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:34,066 INFO L225 Difference]: With dead ends: 166 [2018-10-15 12:36:34,066 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 12:36:34,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:36:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 12:36:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2018-10-15 12:36:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 12:36:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 12:36:34,072 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 157 [2018-10-15 12:36:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:34,072 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 12:36:34,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:36:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 12:36:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 12:36:34,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:34,073 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:34,073 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:34,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash -189944046, now seen corresponding path program 30 times [2018-10-15 12:36:34,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:36,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:36,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:36:36,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:36:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:36:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:36:36,358 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 63 states. [2018-10-15 12:36:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:42,975 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-15 12:36:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:36:42,976 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 162 [2018-10-15 12:36:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:42,978 INFO L225 Difference]: With dead ends: 171 [2018-10-15 12:36:42,978 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 12:36:42,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:36:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 12:36:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-10-15 12:36:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 12:36:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-15 12:36:42,983 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 162 [2018-10-15 12:36:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:42,983 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-15 12:36:42,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:36:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-15 12:36:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-15 12:36:42,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:42,984 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:42,985 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:42,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:42,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1829505506, now seen corresponding path program 31 times [2018-10-15 12:36:42,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:45,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:45,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:36:45,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:36:45,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:36:45,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:36:45,187 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 65 states. [2018-10-15 12:36:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:52,465 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-15 12:36:52,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:36:52,465 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 167 [2018-10-15 12:36:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:52,467 INFO L225 Difference]: With dead ends: 176 [2018-10-15 12:36:52,467 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 12:36:52,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:36:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 12:36:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2018-10-15 12:36:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 12:36:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 12:36:52,472 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 167 [2018-10-15 12:36:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:52,472 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 12:36:52,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:36:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 12:36:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:36:52,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:52,474 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:52,474 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:52,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:52,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1988489490, now seen corresponding path program 32 times [2018-10-15 12:36:52,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:55,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:55,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:36:55,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:36:55,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:36:55,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:36:55,793 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 67 states. [2018-10-15 12:37:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:03,409 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-15 12:37:03,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:37:03,410 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 172 [2018-10-15 12:37:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:03,412 INFO L225 Difference]: With dead ends: 181 [2018-10-15 12:37:03,413 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 12:37:03,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:37:03,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 12:37:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2018-10-15 12:37:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-15 12:37:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-15 12:37:03,419 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 172 [2018-10-15 12:37:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:03,419 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-15 12:37:03,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:37:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-15 12:37:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-15 12:37:03,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:03,420 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:03,421 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:03,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash -234027038, now seen corresponding path program 33 times [2018-10-15 12:37:03,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:05,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:05,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:37:05,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:37:05,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:37:05,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:37:05,973 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 69 states. [2018-10-15 12:37:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:14,525 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-15 12:37:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:37:14,526 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 177 [2018-10-15 12:37:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:14,527 INFO L225 Difference]: With dead ends: 186 [2018-10-15 12:37:14,527 INFO L226 Difference]: Without dead ends: 186 [2018-10-15 12:37:14,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:37:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-15 12:37:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2018-10-15 12:37:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 12:37:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 12:37:14,532 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 177 [2018-10-15 12:37:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:14,532 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 12:37:14,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:37:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 12:37:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 12:37:14,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:14,534 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:14,534 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:14,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:14,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2139901166, now seen corresponding path program 34 times [2018-10-15 12:37:14,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:17,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:17,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:37:17,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:37:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:37:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:37:17,715 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 71 states. [2018-10-15 12:37:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:26,111 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-15 12:37:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:37:26,112 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 182 [2018-10-15 12:37:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:26,113 INFO L225 Difference]: With dead ends: 191 [2018-10-15 12:37:26,113 INFO L226 Difference]: Without dead ends: 191 [2018-10-15 12:37:26,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:37:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-15 12:37:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-10-15 12:37:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-15 12:37:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-15 12:37:26,117 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 182 [2018-10-15 12:37:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:26,117 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-15 12:37:26,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:37:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-15 12:37:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 12:37:26,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:26,118 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:26,118 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:26,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash 543720930, now seen corresponding path program 35 times [2018-10-15 12:37:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:29,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:29,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:37:29,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:37:29,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:37:29,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:37:29,006 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 73 states. [2018-10-15 12:37:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:38,147 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-15 12:37:38,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:37:38,148 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 187 [2018-10-15 12:37:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:38,150 INFO L225 Difference]: With dead ends: 196 [2018-10-15 12:37:38,150 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 12:37:38,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:37:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 12:37:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2018-10-15 12:37:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 12:37:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-15 12:37:38,154 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 187 [2018-10-15 12:37:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:38,155 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-15 12:37:38,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:37:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-15 12:37:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 12:37:38,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:38,156 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:38,156 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:38,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash 362214674, now seen corresponding path program 36 times [2018-10-15 12:37:38,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:40,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:40,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:37:40,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:37:40,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:37:40,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:37:40,888 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 75 states. [2018-10-15 12:37:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:50,536 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-15 12:37:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:37:50,536 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 192 [2018-10-15 12:37:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:50,538 INFO L225 Difference]: With dead ends: 201 [2018-10-15 12:37:50,538 INFO L226 Difference]: Without dead ends: 201 [2018-10-15 12:37:50,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:37:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-15 12:37:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2018-10-15 12:37:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-15 12:37:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-15 12:37:50,543 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 192 [2018-10-15 12:37:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:50,543 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-15 12:37:50,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:37:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-15 12:37:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-15 12:37:50,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:50,544 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:50,545 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:50,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash -385973278, now seen corresponding path program 37 times [2018-10-15 12:37:50,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:53,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:53,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:37:53,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:37:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:37:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:37:53,580 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 77 states. [2018-10-15 12:38:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:03,697 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-15 12:38:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:38:03,698 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 197 [2018-10-15 12:38:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:03,699 INFO L225 Difference]: With dead ends: 206 [2018-10-15 12:38:03,699 INFO L226 Difference]: Without dead ends: 206 [2018-10-15 12:38:03,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:38:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-15 12:38:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-10-15 12:38:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 12:38:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-15 12:38:03,703 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 197 [2018-10-15 12:38:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:03,703 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-15 12:38:03,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:38:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-15 12:38:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:38:03,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:03,704 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:03,704 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:03,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash -787499246, now seen corresponding path program 38 times [2018-10-15 12:38:03,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:06,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:06,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:38:06,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:38:06,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:38:06,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:38:06,760 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 79 states. [2018-10-15 12:38:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:17,269 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-15 12:38:17,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:38:17,270 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 202 [2018-10-15 12:38:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:17,271 INFO L225 Difference]: With dead ends: 211 [2018-10-15 12:38:17,271 INFO L226 Difference]: Without dead ends: 211 [2018-10-15 12:38:17,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:38:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-15 12:38:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2018-10-15 12:38:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-15 12:38:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-10-15 12:38:17,276 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 202 [2018-10-15 12:38:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:17,276 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-10-15 12:38:17,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:38:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-10-15 12:38:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-15 12:38:17,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:17,277 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:17,278 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:17,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1532034590, now seen corresponding path program 39 times [2018-10-15 12:38:17,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:20,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:20,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:38:20,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:38:20,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:38:20,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:38:20,748 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 81 states. [2018-10-15 12:38:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:31,697 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-15 12:38:31,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:38:31,698 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 207 [2018-10-15 12:38:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:31,699 INFO L225 Difference]: With dead ends: 216 [2018-10-15 12:38:31,699 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 12:38:31,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:38:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 12:38:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2018-10-15 12:38:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 12:38:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-15 12:38:31,703 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 207 [2018-10-15 12:38:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:31,703 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-15 12:38:31,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:38:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-15 12:38:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 12:38:31,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:31,704 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:31,705 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:31,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash -436340462, now seen corresponding path program 40 times [2018-10-15 12:38:31,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:35,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:35,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:38:35,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:38:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:38:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:38:35,429 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 83 states. [2018-10-15 12:38:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:46,879 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-15 12:38:46,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:38:46,880 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 212 [2018-10-15 12:38:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:46,881 INFO L225 Difference]: With dead ends: 221 [2018-10-15 12:38:46,882 INFO L226 Difference]: Without dead ends: 221 [2018-10-15 12:38:46,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:38:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-15 12:38:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-10-15 12:38:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:38:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 12:38:46,885 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 212 [2018-10-15 12:38:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:46,885 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 12:38:46,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:38:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 12:38:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 12:38:46,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:46,886 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:46,887 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:46,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 341442530, now seen corresponding path program 41 times [2018-10-15 12:38:46,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:50,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:50,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:38:50,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:38:50,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:38:50,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:38:50,628 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 85 states. [2018-10-15 12:39:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:02,664 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-15 12:39:02,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:39:02,665 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 217 [2018-10-15 12:39:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:02,666 INFO L225 Difference]: With dead ends: 226 [2018-10-15 12:39:02,667 INFO L226 Difference]: Without dead ends: 226 [2018-10-15 12:39:02,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:39:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-15 12:39:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2018-10-15 12:39:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 12:39:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-15 12:39:02,671 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 217 [2018-10-15 12:39:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:02,671 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-15 12:39:02,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:39:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-15 12:39:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 12:39:02,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:02,673 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:02,673 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:02,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash 528595730, now seen corresponding path program 42 times [2018-10-15 12:39:02,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:06,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:06,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:39:06,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:39:06,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:39:06,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:39:06,887 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 87 states. [2018-10-15 12:39:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:19,727 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-15 12:39:19,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:39:19,728 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 222 [2018-10-15 12:39:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:19,729 INFO L225 Difference]: With dead ends: 231 [2018-10-15 12:39:19,729 INFO L226 Difference]: Without dead ends: 231 [2018-10-15 12:39:19,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:39:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-15 12:39:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2018-10-15 12:39:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-15 12:39:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-15 12:39:19,733 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 222 [2018-10-15 12:39:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:19,734 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-15 12:39:19,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:39:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-15 12:39:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-15 12:39:19,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:19,735 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:19,735 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:19,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1625259490, now seen corresponding path program 43 times [2018-10-15 12:39:19,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:23,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:39:23,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:39:23,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:39:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:39:23,559 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 89 states. [2018-10-15 12:39:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:36,942 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-15 12:39:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:39:36,943 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 227 [2018-10-15 12:39:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:36,945 INFO L225 Difference]: With dead ends: 236 [2018-10-15 12:39:36,945 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 12:39:36,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:39:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 12:39:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2018-10-15 12:39:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-15 12:39:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-15 12:39:36,949 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 227 [2018-10-15 12:39:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:36,950 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-15 12:39:36,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:39:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-15 12:39:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-15 12:39:36,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:36,951 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:36,952 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:36,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash -524616430, now seen corresponding path program 44 times [2018-10-15 12:39:36,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:41,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:41,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:39:41,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:39:41,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:39:41,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:39:41,087 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 91 states. [2018-10-15 12:39:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:54,737 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-15 12:39:54,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:39:54,738 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 232 [2018-10-15 12:39:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:54,739 INFO L225 Difference]: With dead ends: 241 [2018-10-15 12:39:54,739 INFO L226 Difference]: Without dead ends: 241 [2018-10-15 12:39:54,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:39:54,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-15 12:39:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2018-10-15 12:39:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-15 12:39:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-10-15 12:39:54,744 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 232 [2018-10-15 12:39:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:54,744 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-10-15 12:39:54,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:39:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-10-15 12:39:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-15 12:39:54,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:54,746 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:54,746 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:54,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:54,746 INFO L82 PathProgramCache]: Analyzing trace with hash 455048162, now seen corresponding path program 45 times [2018-10-15 12:39:54,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:58,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:58,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:39:58,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:39:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:39:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:39:58,921 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 93 states. [2018-10-15 12:40:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:13,561 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-15 12:40:13,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:40:13,563 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 237 [2018-10-15 12:40:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:13,565 INFO L225 Difference]: With dead ends: 246 [2018-10-15 12:40:13,565 INFO L226 Difference]: Without dead ends: 246 [2018-10-15 12:40:13,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:40:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-15 12:40:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2018-10-15 12:40:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 12:40:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 12:40:13,569 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 237 [2018-10-15 12:40:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:13,570 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 12:40:13,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:40:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 12:40:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 12:40:13,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:13,571 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:13,572 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:13,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:13,572 INFO L82 PathProgramCache]: Analyzing trace with hash 617201426, now seen corresponding path program 46 times [2018-10-15 12:40:13,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:18,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:18,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:40:18,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:40:18,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:40:18,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:40:18,192 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 95 states. [2018-10-15 12:40:29,916 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 12:40:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:33,810 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-15 12:40:33,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:40:33,810 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 242 [2018-10-15 12:40:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:33,812 INFO L225 Difference]: With dead ends: 251 [2018-10-15 12:40:33,812 INFO L226 Difference]: Without dead ends: 251 [2018-10-15 12:40:33,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:40:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-15 12:40:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2018-10-15 12:40:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 12:40:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-15 12:40:33,816 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 242 [2018-10-15 12:40:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:33,816 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-15 12:40:33,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:40:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-15 12:40:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 12:40:33,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:33,818 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:33,818 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:33,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:33,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1006238178, now seen corresponding path program 47 times [2018-10-15 12:40:33,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:38,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:38,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:40:38,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:40:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:40:38,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:40:38,458 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 97 states. [2018-10-15 12:40:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:54,243 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-15 12:40:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:40:54,243 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 247 [2018-10-15 12:40:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:54,245 INFO L225 Difference]: With dead ends: 256 [2018-10-15 12:40:54,245 INFO L226 Difference]: Without dead ends: 256 [2018-10-15 12:40:54,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:40:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-15 12:40:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2018-10-15 12:40:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-15 12:40:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-15 12:40:54,250 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 247 [2018-10-15 12:40:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:54,251 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-15 12:40:54,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:40:54,251 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-15 12:40:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 12:40:54,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:54,252 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:54,253 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:54,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2127429906, now seen corresponding path program 48 times [2018-10-15 12:40:54,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:59,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:59,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:40:59,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:40:59,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:40:59,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:40:59,214 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 99 states. [2018-10-15 12:41:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:15,479 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-15 12:41:15,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:41:15,479 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 252 [2018-10-15 12:41:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:15,481 INFO L225 Difference]: With dead ends: 261 [2018-10-15 12:41:15,481 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 12:41:15,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:41:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 12:41:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2018-10-15 12:41:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-15 12:41:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-10-15 12:41:15,486 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 252 [2018-10-15 12:41:15,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:15,486 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-10-15 12:41:15,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:41:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-10-15 12:41:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-15 12:41:15,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:15,488 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:15,488 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:15,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 609155042, now seen corresponding path program 49 times [2018-10-15 12:41:15,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:20,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:20,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:41:20,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:41:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:41:20,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:41:20,492 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 101 states. [2018-10-15 12:41:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:37,964 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-15 12:41:37,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:41:37,964 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 257 [2018-10-15 12:41:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:37,966 INFO L225 Difference]: With dead ends: 266 [2018-10-15 12:41:37,966 INFO L226 Difference]: Without dead ends: 266 [2018-10-15 12:41:37,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=591, Invalid=38811, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:41:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-15 12:41:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2018-10-15 12:41:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 12:41:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 12:41:37,971 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 257 [2018-10-15 12:41:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:37,971 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 12:41:37,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:41:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 12:41:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 12:41:37,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:37,973 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:37,973 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:37,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:37,974 INFO L82 PathProgramCache]: Analyzing trace with hash 434619154, now seen corresponding path program 50 times [2018-10-15 12:41:37,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:43,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:43,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:41:43,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:41:43,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:41:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:41:43,182 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 103 states. [2018-10-15 12:42:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:01,037 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-15 12:42:01,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:42:01,037 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 262 [2018-10-15 12:42:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:01,039 INFO L225 Difference]: With dead ends: 271 [2018-10-15 12:42:01,040 INFO L226 Difference]: Without dead ends: 271 [2018-10-15 12:42:01,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=603, Invalid=40403, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:42:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-15 12:42:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2018-10-15 12:42:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-15 12:42:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-10-15 12:42:01,043 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 262 [2018-10-15 12:42:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:01,044 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-10-15 12:42:01,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:42:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-10-15 12:42:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-15 12:42:01,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:01,045 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:01,046 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:01,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1661045278, now seen corresponding path program 51 times [2018-10-15 12:42:01,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:06,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:06,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:42:06,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:42:06,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:42:06,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:42:06,392 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 105 states. [2018-10-15 12:42:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:25,032 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-15 12:42:25,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:42:25,032 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 267 [2018-10-15 12:42:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:25,034 INFO L225 Difference]: With dead ends: 276 [2018-10-15 12:42:25,034 INFO L226 Difference]: Without dead ends: 276 [2018-10-15 12:42:25,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5151 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=615, Invalid=42027, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:42:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-15 12:42:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 273. [2018-10-15 12:42:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 12:42:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-15 12:42:25,038 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 267 [2018-10-15 12:42:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:25,039 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-15 12:42:25,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:42:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-15 12:42:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-15 12:42:25,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:25,040 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:25,040 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:25,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1187576558, now seen corresponding path program 52 times [2018-10-15 12:42:25,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:30,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:30,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:42:30,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:42:30,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:42:30,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:42:30,680 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 107 states. [2018-10-15 12:42:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:49,998 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 12:42:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:42:49,999 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 272 [2018-10-15 12:42:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:50,001 INFO L225 Difference]: With dead ends: 281 [2018-10-15 12:42:50,001 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 12:42:50,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5356 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=627, Invalid=43683, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:42:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 12:42:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2018-10-15 12:42:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-15 12:42:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-15 12:42:50,006 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 272 [2018-10-15 12:42:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:50,006 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-15 12:42:50,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:42:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-15 12:42:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-15 12:42:50,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:50,008 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:50,008 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:50,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -689409054, now seen corresponding path program 53 times [2018-10-15 12:42:50,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:55,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:55,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:42:55,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:42:55,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:42:55,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:42:55,718 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 109 states. [2018-10-15 12:43:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:15,721 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-15 12:43:15,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:43:15,721 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 277 [2018-10-15 12:43:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:15,723 INFO L225 Difference]: With dead ends: 286 [2018-10-15 12:43:15,723 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 12:43:15,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5565 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=639, Invalid=45371, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:43:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 12:43:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2018-10-15 12:43:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 12:43:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 12:43:15,727 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 277 [2018-10-15 12:43:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:15,728 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 12:43:15,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:43:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 12:43:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 12:43:15,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:15,729 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:15,729 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:15,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1210333422, now seen corresponding path program 54 times [2018-10-15 12:43:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat