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/functions_false-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:34:50,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:34:50,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:34:50,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:34:50,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:34:50,212 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:34:50,213 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:34:50,215 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:34:50,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:34:50,217 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:34:50,218 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:34:50,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:34:50,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:34:50,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:34:50,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:34:50,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:34:50,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:34:50,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:34:50,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:34:50,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:34:50,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:34:50,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:34:50,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:34:50,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:34:50,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:34:50,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:34:50,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:34:50,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:34:50,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:34:50,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:34:50,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:34:50,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:34:50,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:34:50,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:34:50,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:34:50,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:34:50,251 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:50,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:34:50,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:34:50,273 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:34:50,273 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:34:50,273 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:34:50,274 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:34:50,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:34:50,274 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:34:50,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:34:50,275 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:34:50,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:34:50,275 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:34:50,275 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:34:50,281 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:34:50,281 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:34:50,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:34:50,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:34:50,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:34:50,351 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:34:50,351 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:34:50,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/functions_false-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:34:50,352 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/functions_false-unreach-call1_true-termination.i_3.bpl' [2018-10-15 12:34:50,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:34:50,417 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:34:50,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:34:50,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:34:50,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:34:50,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (1/1) ... [2018-10-15 12:34:50,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (1/1) ... [2018-10-15 12:34:50,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (1/1) ... [2018-10-15 12:34:50,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (1/1) ... [2018-10-15 12:34:50,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (1/1) ... [2018-10-15 12:34:50,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (1/1) ... [2018-10-15 12:34:50,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (1/1) ... [2018-10-15 12:34:50,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:34:50,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:34:50,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:34:50,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:34:50,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (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:50,562 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:34:50,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:34:50,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:34:50,913 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:34:50,914 INFO L202 PluginConnector]: Adding new model functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:34:50 BoogieIcfgContainer [2018-10-15 12:34:50,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:34:50,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:34:50,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:34:50,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:34:50,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:50" (1/2) ... [2018-10-15 12:34:50,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe0ff37 and model type functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:34:50, skipping insertion in model container [2018-10-15 12:34:50,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions_false-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:34:50" (2/2) ... [2018-10-15 12:34:50,928 INFO L112 eAbstractionObserver]: Analyzing ICFG functions_false-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:34:50,953 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:34:50,965 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:34:50,990 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:34:51,059 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:34:51,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:34:51,060 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:34:51,061 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:34:51,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:34:51,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:34:51,061 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:34:51,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:34:51,062 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:34:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-15 12:34:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:34:51,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:51,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:51,116 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:51,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2036427093, now seen corresponding path program 1 times [2018-10-15 12:34:51,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:51,335 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:51,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:34:51,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:34:51,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:34:51,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:34:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:34:51,358 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-15 12:34:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:51,423 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-15 12:34:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:34:51,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:34:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:51,436 INFO L225 Difference]: With dead ends: 27 [2018-10-15 12:34:51,436 INFO L226 Difference]: Without dead ends: 27 [2018-10-15 12:34:51,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:34:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-15 12:34:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-15 12:34:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 12:34:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-15 12:34:51,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2018-10-15 12:34:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:51,476 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-15 12:34:51,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:34:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-15 12:34:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 12:34:51,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:51,477 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:51,477 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:51,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash 546142339, now seen corresponding path program 1 times [2018-10-15 12:34:51,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:51,793 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:51,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:51,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:34:51,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:34:51,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:34:51,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:34:51,800 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-10-15 12:34:52,078 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 12:34:52,443 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 12:34:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:52,614 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 12:34:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:34:52,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-10-15 12:34:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:52,616 INFO L225 Difference]: With dead ends: 36 [2018-10-15 12:34:52,617 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 12:34:52,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:34:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 12:34:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-10-15 12:34:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 12:34:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 12:34:52,623 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2018-10-15 12:34:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:52,624 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 12:34:52,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:34:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 12:34:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:34:52,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:52,626 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:52,626 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:52,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash -38494955, now seen corresponding path program 2 times [2018-10-15 12:34:52,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:53,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:53,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:34:53,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:34:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:34:53,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:34:53,309 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 13 states. [2018-10-15 12:34:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:54,115 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 12:34:54,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:34:54,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-10-15 12:34:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:54,118 INFO L225 Difference]: With dead ends: 45 [2018-10-15 12:34:54,119 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 12:34:54,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:34:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 12:34:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-10-15 12:34:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 12:34:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 12:34:54,127 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2018-10-15 12:34:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:54,127 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 12:34:54,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:34:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 12:34:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:34:54,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:54,129 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:54,129 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:54,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:54,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1573356349, now seen corresponding path program 3 times [2018-10-15 12:34:54,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:54,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:54,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:34:54,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:34:54,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:34:54,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:34:54,736 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 18 states. [2018-10-15 12:34:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:55,922 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 12:34:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:34:55,923 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-10-15 12:34:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:55,924 INFO L225 Difference]: With dead ends: 54 [2018-10-15 12:34:55,925 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:34:55,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=201, Invalid=1521, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:34:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:34:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-15 12:34:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:34:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 12:34:55,933 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 37 [2018-10-15 12:34:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:55,933 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 12:34:55,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:34:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 12:34:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:34:55,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:55,935 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:55,935 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:55,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1686790357, now seen corresponding path program 4 times [2018-10-15 12:34:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:56,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:56,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:34:56,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:34:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:34:56,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:34:56,467 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 23 states. [2018-10-15 12:34:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:58,247 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-15 12:34:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:34:58,248 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-10-15 12:34:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:58,250 INFO L225 Difference]: With dead ends: 63 [2018-10-15 12:34:58,250 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 12:34:58,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=267, Invalid=2703, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:34:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 12:34:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-10-15 12:34:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:34:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 12:34:58,258 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 46 [2018-10-15 12:34:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:58,259 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 12:34:58,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:34:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 12:34:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 12:34:58,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:58,260 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:58,261 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:58,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1128460547, now seen corresponding path program 5 times [2018-10-15 12:34:58,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:59,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 12:34:59,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 12:34:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 12:34:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:34:59,298 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 28 states. [2018-10-15 12:35:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:01,427 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 12:35:01,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:35:01,431 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2018-10-15 12:35:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:01,432 INFO L225 Difference]: With dead ends: 72 [2018-10-15 12:35:01,433 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:35:01,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=333, Invalid=4223, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:35:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:35:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2018-10-15 12:35:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:35:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 12:35:01,441 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 55 [2018-10-15 12:35:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:01,442 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 12:35:01,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 12:35:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 12:35:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:35:01,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:01,444 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:01,444 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:01,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1470188395, now seen corresponding path program 6 times [2018-10-15 12:35:01,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:02,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:02,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:35:02,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:35:02,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:35:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:35:02,336 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-10-15 12:35:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:05,822 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:35:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:35:05,826 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-10-15 12:35:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:05,827 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:35:05,827 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:35:05,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=399, Invalid=6081, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:35:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:35:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-10-15 12:35:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 12:35:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-15 12:35:05,836 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 64 [2018-10-15 12:35:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:05,836 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-15 12:35:05,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:35:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-15 12:35:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 12:35:05,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:05,838 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:05,838 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:05,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 347133251, now seen corresponding path program 7 times [2018-10-15 12:35:05,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:06,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:06,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:35:06,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:35:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:35:06,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:35:06,864 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2018-10-15 12:35:09,571 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 12:35:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:10,744 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 12:35:10,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:35:10,745 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-10-15 12:35:10,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:10,747 INFO L225 Difference]: With dead ends: 90 [2018-10-15 12:35:10,747 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:35:10,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=465, Invalid=8277, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:35:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:35:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-10-15 12:35:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:35:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:35:10,756 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 73 [2018-10-15 12:35:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:10,757 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:35:10,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:35:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:35:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:35:10,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:10,759 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:10,759 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:10,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:10,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1666344875, now seen corresponding path program 8 times [2018-10-15 12:35:10,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:12,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:12,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:35:12,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:35:12,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:35:12,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:12,611 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-10-15 12:35:14,185 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-15 12:35:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:17,653 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 12:35:17,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:35:17,654 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-10-15 12:35:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:17,656 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:35:17,656 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:35:17,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=531, Invalid=10811, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:35:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:35:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-10-15 12:35:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 12:35:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-15 12:35:17,666 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 82 [2018-10-15 12:35:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:17,667 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-15 12:35:17,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:35:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-15 12:35:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 12:35:17,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:17,669 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:17,669 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:17,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:17,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1854286211, now seen corresponding path program 9 times [2018-10-15 12:35:17,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:19,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:19,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:35:19,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:35:19,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:35:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:35:19,528 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 48 states. [2018-10-15 12:35:20,691 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 12:35:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:24,864 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 12:35:24,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:35:24,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-10-15 12:35:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:24,867 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:35:24,867 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:35:24,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=597, Invalid=13683, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 12:35:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:35:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-10-15 12:35:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:35:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:35:24,876 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 91 [2018-10-15 12:35:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:24,876 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:35:24,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:35:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:35:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:35:24,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:24,878 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:24,879 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:24,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1376580587, now seen corresponding path program 10 times [2018-10-15 12:35:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:26,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:26,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:35:26,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:35:26,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:35:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:35:26,273 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2018-10-15 12:35:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:32,109 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 12:35:32,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:35:32,110 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2018-10-15 12:35:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:32,111 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:35:32,112 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:35:32,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=663, Invalid=16893, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:35:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:35:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2018-10-15 12:35:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 12:35:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 12:35:32,119 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 100 [2018-10-15 12:35:32,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:32,120 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 12:35:32,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:35:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 12:35:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:35:32,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:32,122 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:32,122 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:32,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 801566147, now seen corresponding path program 11 times [2018-10-15 12:35:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:34,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:34,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 12:35:34,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 12:35:34,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 12:35:34,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:35:34,537 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 58 states. [2018-10-15 12:35:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:41,580 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 12:35:41,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 12:35:41,580 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 109 [2018-10-15 12:35:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:41,582 INFO L225 Difference]: With dead ends: 126 [2018-10-15 12:35:41,582 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:35:41,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=729, Invalid=20441, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 12:35:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:35:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-10-15 12:35:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:35:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 12:35:41,591 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 109 [2018-10-15 12:35:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:41,591 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 12:35:41,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 12:35:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 12:35:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:35:41,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:41,597 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:41,597 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:41,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1582624811, now seen corresponding path program 12 times [2018-10-15 12:35:41,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:43,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:43,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:35:43,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:35:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:35:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:35:43,540 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 63 states. [2018-10-15 12:35:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:51,534 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-15 12:35:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 12:35:51,535 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 118 [2018-10-15 12:35:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:51,537 INFO L225 Difference]: With dead ends: 135 [2018-10-15 12:35:51,537 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 12:35:51,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4488 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=795, Invalid=24327, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:35:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 12:35:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-10-15 12:35:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 12:35:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 12:35:51,543 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 118 [2018-10-15 12:35:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:51,544 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 12:35:51,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:35:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 12:35:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:35:51,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:51,546 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:51,546 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:51,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash -25746941, now seen corresponding path program 13 times [2018-10-15 12:35:51,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:53,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:53,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 12:35:53,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 12:35:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 12:35:53,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:35:53,833 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 68 states. [2018-10-15 12:36:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:03,094 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 12:36:03,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:36:03,095 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 127 [2018-10-15 12:36:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:03,096 INFO L225 Difference]: With dead ends: 144 [2018-10-15 12:36:03,096 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:36:03,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5278 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=861, Invalid=28551, Unknown=0, NotChecked=0, Total=29412 [2018-10-15 12:36:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:36:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2018-10-15 12:36:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 12:36:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 12:36:03,103 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 127 [2018-10-15 12:36:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:03,103 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 12:36:03,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 12:36:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 12:36:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:36:03,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:03,105 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:03,105 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:03,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1448190869, now seen corresponding path program 14 times [2018-10-15 12:36:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:06,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:06,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:36:06,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:36:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:36:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:36:06,040 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 73 states. [2018-10-15 12:36:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:16,508 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 12:36:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 12:36:16,509 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 136 [2018-10-15 12:36:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:16,511 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:36:16,511 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:36:16,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6132 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=927, Invalid=33113, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 12:36:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:36:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2018-10-15 12:36:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 12:36:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 12:36:16,517 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 136 [2018-10-15 12:36:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:16,518 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 12:36:16,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:36:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 12:36:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:36:16,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:16,519 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:16,520 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:16,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:16,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2019899837, now seen corresponding path program 15 times [2018-10-15 12:36:16,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:20,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 12:36:20,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 12:36:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 12:36:20,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:36:20,280 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 78 states. [2018-10-15 12:36:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:31,999 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 12:36:32,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-15 12:36:32,000 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 145 [2018-10-15 12:36:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:32,002 INFO L225 Difference]: With dead ends: 162 [2018-10-15 12:36:32,002 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:36:32,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7050 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=993, Invalid=38013, Unknown=0, NotChecked=0, Total=39006 [2018-10-15 12:36:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:36:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2018-10-15 12:36:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:36:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:36:32,007 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 145 [2018-10-15 12:36:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:32,008 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:36:32,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 12:36:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:36:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:36:32,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:32,010 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:32,010 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:32,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2090678443, now seen corresponding path program 16 times [2018-10-15 12:36:32,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:35,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:35,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:36:35,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:36:35,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:36:35,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:36:35,934 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 83 states. [2018-10-15 12:36:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:49,087 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-15 12:36:49,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:36:49,088 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 154 [2018-10-15 12:36:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:49,090 INFO L225 Difference]: With dead ends: 171 [2018-10-15 12:36:49,090 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 12:36:49,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8032 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1059, Invalid=43251, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:36:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 12:36:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-10-15 12:36:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:36:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 12:36:49,098 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 154 [2018-10-15 12:36:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:49,098 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 12:36:49,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:36:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 12:36:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:36:49,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:49,100 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:49,100 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:49,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:49,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1086989693, now seen corresponding path program 17 times [2018-10-15 12:36:49,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:53,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:53,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 12:36:53,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 12:36:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 12:36:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:36:53,644 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 88 states. [2018-10-15 12:37:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:08,596 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-15 12:37:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 12:37:08,597 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 163 [2018-10-15 12:37:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:08,598 INFO L225 Difference]: With dead ends: 180 [2018-10-15 12:37:08,598 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 12:37:08,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9078 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1125, Invalid=48827, Unknown=0, NotChecked=0, Total=49952 [2018-10-15 12:37:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 12:37:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2018-10-15 12:37:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 12:37:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 12:37:08,603 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 163 [2018-10-15 12:37:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:08,604 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 12:37:08,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 12:37:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 12:37:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:37:08,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:08,605 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:08,605 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:08,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2035972885, now seen corresponding path program 18 times [2018-10-15 12:37:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:13,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:13,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:37:13,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:37:13,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:37:13,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:37:13,793 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 93 states. [2018-10-15 12:37:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:30,419 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 12:37:30,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-10-15 12:37:30,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 172 [2018-10-15 12:37:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:30,421 INFO L225 Difference]: With dead ends: 189 [2018-10-15 12:37:30,422 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:37:30,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10188 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1191, Invalid=54741, Unknown=0, NotChecked=0, Total=55932 [2018-10-15 12:37:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:37:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-10-15 12:37:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:37:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-15 12:37:30,427 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 172 [2018-10-15 12:37:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:30,428 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-15 12:37:30,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:37:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-15 12:37:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:37:30,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:30,429 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:30,429 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:30,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash 541875907, now seen corresponding path program 19 times [2018-10-15 12:37:30,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 1558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:35,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:35,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-10-15 12:37:35,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-15 12:37:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-15 12:37:35,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 12:37:35,406 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 98 states. [2018-10-15 12:37:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:54,145 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-15 12:37:54,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:37:54,146 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 181 [2018-10-15 12:37:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:54,147 INFO L225 Difference]: With dead ends: 198 [2018-10-15 12:37:54,148 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 12:37:54,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11362 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1257, Invalid=60993, Unknown=0, NotChecked=0, Total=62250 [2018-10-15 12:37:54,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 12:37:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-10-15 12:37:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 12:37:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 12:37:54,153 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 181 [2018-10-15 12:37:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:54,154 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 12:37:54,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-15 12:37:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 12:37:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:37:54,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:54,155 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:54,155 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:54,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash -508248363, now seen corresponding path program 20 times [2018-10-15 12:37:54,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 0 proven. 1730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:59,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:37:59,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:37:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:37:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:37:59,550 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 103 states. [2018-10-15 12:38:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:19,542 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-15 12:38:19,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 12:38:19,542 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 190 [2018-10-15 12:38:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:19,544 INFO L225 Difference]: With dead ends: 207 [2018-10-15 12:38:19,544 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:38:19,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12600 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=1323, Invalid=67583, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:38:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:38:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-10-15 12:38:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:38:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 12:38:19,551 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 190 [2018-10-15 12:38:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:19,552 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 12:38:19,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:38:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 12:38:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:38:19,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:19,553 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:19,553 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:19,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash -320711933, now seen corresponding path program 21 times [2018-10-15 12:38:19,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:26,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:26,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 12:38:26,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 12:38:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 12:38:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:38:26,012 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 108 states. [2018-10-15 12:38:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:47,512 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-15 12:38:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-10-15 12:38:47,515 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 199 [2018-10-15 12:38:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:47,516 INFO L225 Difference]: With dead ends: 216 [2018-10-15 12:38:47,516 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 12:38:47,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13902 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1389, Invalid=74511, Unknown=0, NotChecked=0, Total=75900 [2018-10-15 12:38:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 12:38:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2018-10-15 12:38:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 12:38:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-15 12:38:47,523 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 199 [2018-10-15 12:38:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:47,523 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-15 12:38:47,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 12:38:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-15 12:38:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 12:38:47,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:47,525 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:47,525 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:47,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2129498773, now seen corresponding path program 22 times [2018-10-15 12:38:47,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 0 proven. 2101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:54,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:54,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:38:54,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:38:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:38:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:38:54,010 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 113 states. [2018-10-15 12:39:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:17,446 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 12:39:17,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 12:39:17,447 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 208 [2018-10-15 12:39:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:17,448 INFO L225 Difference]: With dead ends: 225 [2018-10-15 12:39:17,448 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:39:17,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1455, Invalid=81777, Unknown=0, NotChecked=0, Total=83232 [2018-10-15 12:39:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:39:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2018-10-15 12:39:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:39:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 12:39:17,455 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 208 [2018-10-15 12:39:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:17,456 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 12:39:17,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:39:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 12:39:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 12:39:17,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:17,457 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:17,458 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:17,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1845212995, now seen corresponding path program 23 times [2018-10-15 12:39:17,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 0 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:24,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:24,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 12:39:24,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 12:39:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 12:39:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 12:39:24,655 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 118 states. [2018-10-15 12:39:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:51,011 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 12:39:51,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 12:39:51,011 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 217 [2018-10-15 12:39:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:51,013 INFO L225 Difference]: With dead ends: 234 [2018-10-15 12:39:51,013 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 12:39:51,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16698 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=1521, Invalid=89381, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 12:39:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 12:39:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2018-10-15 12:39:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:39:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:39:51,020 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 217 [2018-10-15 12:39:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:51,021 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:39:51,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 12:39:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:39:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:39:51,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:51,022 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:51,022 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:51,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -327092651, now seen corresponding path program 24 times [2018-10-15 12:39:51,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:58,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:58,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:39:58,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:39:58,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:39:58,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:39:58,754 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 123 states. [2018-10-15 12:40:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:26,640 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-15 12:40:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-10-15 12:40:26,643 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 226 [2018-10-15 12:40:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:26,645 INFO L225 Difference]: With dead ends: 243 [2018-10-15 12:40:26,645 INFO L226 Difference]: Without dead ends: 243 [2018-10-15 12:40:26,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18192 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=1587, Invalid=97323, Unknown=0, NotChecked=0, Total=98910 [2018-10-15 12:40:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-15 12:40:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 236. [2018-10-15 12:40:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 12:40:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 12:40:26,652 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 226 [2018-10-15 12:40:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:26,653 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 12:40:26,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:40:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 12:40:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 12:40:26,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:26,655 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:26,655 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:26,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 865897347, now seen corresponding path program 25 times [2018-10-15 12:40:26,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 0 proven. 2725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:34,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:34,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-10-15 12:40:34,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-15 12:40:34,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-15 12:40:34,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 12:40:34,433 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 128 states. [2018-10-15 12:41:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:04,447 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-15 12:41:04,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 12:41:04,447 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 235 [2018-10-15 12:41:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:04,449 INFO L225 Difference]: With dead ends: 252 [2018-10-15 12:41:04,449 INFO L226 Difference]: Without dead ends: 252 [2018-10-15 12:41:04,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19750 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=1653, Invalid=105603, Unknown=0, NotChecked=0, Total=107256 [2018-10-15 12:41:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-15 12:41:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-10-15 12:41:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 12:41:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 12:41:04,455 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 235 [2018-10-15 12:41:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:04,455 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 12:41:04,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-15 12:41:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 12:41:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 12:41:04,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:04,457 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:04,457 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:04,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1592453653, now seen corresponding path program 26 times [2018-10-15 12:41:04,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 0 proven. 2951 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:13,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:13,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:41:13,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:41:13,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:41:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:41:13,238 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 133 states. [2018-10-15 12:41:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:45,511 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-15 12:41:45,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-15 12:41:45,511 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 244 [2018-10-15 12:41:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:45,512 INFO L225 Difference]: With dead ends: 261 [2018-10-15 12:41:45,513 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 12:41:45,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21372 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=1719, Invalid=114221, Unknown=0, NotChecked=0, Total=115940 [2018-10-15 12:41:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 12:41:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2018-10-15 12:41:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 12:41:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 12:41:45,518 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 244 [2018-10-15 12:41:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:45,519 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 12:41:45,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:41:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 12:41:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 12:41:45,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:45,520 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:45,521 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:45,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:45,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1422446531, now seen corresponding path program 27 times [2018-10-15 12:41:45,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:54,990 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:41:54,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:54,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-10-15 12:41:54,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-15 12:41:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-15 12:41:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 12:41:54,991 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 138 states. [2018-10-15 12:42:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:29,968 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-15 12:42:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 12:42:29,969 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 253 [2018-10-15 12:42:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:29,971 INFO L225 Difference]: With dead ends: 270 [2018-10-15 12:42:29,971 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 12:42:29,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23058 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=1785, Invalid=123177, Unknown=0, NotChecked=0, Total=124962 [2018-10-15 12:42:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 12:42:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 263. [2018-10-15 12:42:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 12:42:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 12:42:29,977 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 253 [2018-10-15 12:42:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:29,978 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 12:42:29,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-15 12:42:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 12:42:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 12:42:29,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:29,980 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:29,980 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:29,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1671917013, now seen corresponding path program 28 times [2018-10-15 12:42:29,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3430 backedges. 0 proven. 3430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:39,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:39,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 12:42:39,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 12:42:39,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 12:42:39,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:42:39,816 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 143 states. [2018-10-15 12:43:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:17,104 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-15 12:43:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-10-15 12:43:17,104 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 262 [2018-10-15 12:43:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:17,105 INFO L225 Difference]: With dead ends: 279 [2018-10-15 12:43:17,106 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:43:17,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24808 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=1851, Invalid=132471, Unknown=0, NotChecked=0, Total=134322 [2018-10-15 12:43:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:43:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2018-10-15 12:43:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 12:43:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-15 12:43:17,113 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 262 [2018-10-15 12:43:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:17,113 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-15 12:43:17,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 12:43:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-15 12:43:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 12:43:17,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:17,115 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:17,115 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:17,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:17,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1350269949, now seen corresponding path program 29 times [2018-10-15 12:43:17,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat