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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/overflow_true-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:06:10,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:06:10,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:06:10,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:06:10,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:06:10,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:06:10,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:06:10,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:06:10,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:06:10,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:06:10,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:06:10,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:06:10,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:06:10,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:06:10,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:06:10,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:06:10,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:06:10,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:06:10,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:06:10,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:06:10,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:06:10,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:06:10,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:06:10,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:06:10,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:06:10,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:06:10,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:06:10,394 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:06:10,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:06:10,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:06:10,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:06:10,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:06:10,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:06:10,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:06:10,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:06:10,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:06:10,400 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 13:06:10,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:06:10,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:06:10,414 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:06:10,414 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:06:10,414 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:06:10,414 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:06:10,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:06:10,415 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:06:10,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:06:10,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:06:10,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:06:10,416 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:06:10,416 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:06:10,417 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:06:10,417 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:06:10,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:06:10,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:06:10,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:06:10,499 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:06:10,499 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:06:10,500 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/overflow_true-unreach-call1.i_3.bpl [2018-10-15 13:06:10,500 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/overflow_true-unreach-call1.i_3.bpl' [2018-10-15 13:06:10,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:06:10,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:06:10,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:06:10,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:06:10,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:06:10,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (1/1) ... [2018-10-15 13:06:10,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (1/1) ... [2018-10-15 13:06:10,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (1/1) ... [2018-10-15 13:06:10,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (1/1) ... [2018-10-15 13:06:10,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (1/1) ... [2018-10-15 13:06:10,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (1/1) ... [2018-10-15 13:06:10,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (1/1) ... [2018-10-15 13:06:10,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:06:10,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:06:10,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:06:10,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:06:10,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (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 13:06:10,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:06:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:06:10,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:06:11,044 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:06:11,045 INFO L202 PluginConnector]: Adding new model overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:11 BoogieIcfgContainer [2018-10-15 13:06:11,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:06:11,046 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:06:11,046 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:06:11,047 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:06:11,051 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:11" (1/1) ... [2018-10-15 13:06:11,060 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:06:11,077 INFO L202 PluginConnector]: Adding new model overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:06:11 BasicIcfg [2018-10-15 13:06:11,078 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:06:11,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:06:11,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:06:11,083 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:06:11,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:06:10" (1/3) ... [2018-10-15 13:06:11,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d379f82 and model type overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:11, skipping insertion in model container [2018-10-15 13:06:11,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:11" (2/3) ... [2018-10-15 13:06:11,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d379f82 and model type overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:06:11, skipping insertion in model container [2018-10-15 13:06:11,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:06:11" (3/3) ... [2018-10-15 13:06:11,091 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow_true-unreach-call1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:06:11,103 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:06:11,113 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:06:11,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:06:11,157 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:06:11,158 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:06:11,158 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:06:11,158 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:06:11,158 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:06:11,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:06:11,159 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:06:11,159 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:06:11,159 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:06:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-15 13:06:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 13:06:11,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:11,181 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:11,182 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:11,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1367695513, now seen corresponding path program 1 times [2018-10-15 13:06:11,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:11,438 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 13:06:11,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:06:11,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:06:11,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:06:11,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:06:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:06:11,504 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-10-15 13:06:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:11,599 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-15 13:06:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:06:11,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 13:06:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:11,612 INFO L225 Difference]: With dead ends: 14 [2018-10-15 13:06:11,613 INFO L226 Difference]: Without dead ends: 14 [2018-10-15 13:06:11,615 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 13:06:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-15 13:06:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-15 13:06:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-15 13:06:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-15 13:06:11,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-15 13:06:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:11,654 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-15 13:06:11,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:06:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-15 13:06:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 13:06:11,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:11,655 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:11,655 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:11,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 497117989, now seen corresponding path program 1 times [2018-10-15 13:06:11,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:11,982 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 13:06:11,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:11,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 13:06:11,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 13:06:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 13:06:11,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:06:11,988 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-10-15 13:06:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:12,092 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-15 13:06:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 13:06:12,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-15 13:06:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:12,094 INFO L225 Difference]: With dead ends: 16 [2018-10-15 13:06:12,094 INFO L226 Difference]: Without dead ends: 16 [2018-10-15 13:06:12,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:06:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-15 13:06:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-10-15 13:06:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-15 13:06:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-15 13:06:12,098 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-15 13:06:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:12,098 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-15 13:06:12,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 13:06:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-15 13:06:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-15 13:06:12,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:12,100 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:12,100 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:12,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1581530979, now seen corresponding path program 2 times [2018-10-15 13:06:12,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:12,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:12,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:06:12,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:06:12,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:06:12,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:06:12,265 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-10-15 13:06:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:12,423 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 13:06:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:06:12,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-15 13:06:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:12,426 INFO L225 Difference]: With dead ends: 18 [2018-10-15 13:06:12,427 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 13:06:12,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:06:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 13:06:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-15 13:06:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-15 13:06:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-15 13:06:12,431 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-15 13:06:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:12,432 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-15 13:06:12,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:06:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-15 13:06:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 13:06:12,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:12,433 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:12,434 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:12,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 25361441, now seen corresponding path program 3 times [2018-10-15 13:06:12,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:12,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:12,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 13:06:12,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 13:06:12,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 13:06:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:06:12,753 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-10-15 13:06:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:12,914 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-15 13:06:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:06:12,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-15 13:06:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:12,916 INFO L225 Difference]: With dead ends: 20 [2018-10-15 13:06:12,916 INFO L226 Difference]: Without dead ends: 20 [2018-10-15 13:06:12,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:06:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-15 13:06:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-10-15 13:06:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 13:06:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 13:06:12,921 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-15 13:06:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:12,921 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 13:06:12,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 13:06:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 13:06:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 13:06:12,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:12,922 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:12,923 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:12,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash -804945569, now seen corresponding path program 4 times [2018-10-15 13:06:12,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:13,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:13,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:06:13,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:06:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:06:13,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:06:13,205 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-10-15 13:06:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:13,331 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-15 13:06:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:06:13,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-15 13:06:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:13,334 INFO L225 Difference]: With dead ends: 22 [2018-10-15 13:06:13,334 INFO L226 Difference]: Without dead ends: 22 [2018-10-15 13:06:13,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:06:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-15 13:06:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-15 13:06:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 13:06:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 13:06:13,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-15 13:06:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:13,339 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 13:06:13,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:06:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 13:06:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 13:06:13,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:13,340 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:13,341 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:13,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash 133934877, now seen corresponding path program 5 times [2018-10-15 13:06:13,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:13,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:13,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:06:13,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:06:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:06:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:06:13,527 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-10-15 13:06:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:14,002 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 13:06:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 13:06:14,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-15 13:06:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:14,004 INFO L225 Difference]: With dead ends: 24 [2018-10-15 13:06:14,004 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 13:06:14,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:06:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 13:06:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-10-15 13:06:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 13:06:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 13:06:14,008 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-15 13:06:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:14,009 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 13:06:14,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:06:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 13:06:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 13:06:14,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:14,010 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:14,010 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:14,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash 454911323, now seen corresponding path program 6 times [2018-10-15 13:06:14,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:14,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:14,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:06:14,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:06:14,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:06:14,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:06:14,469 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-10-15 13:06:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:14,674 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-15 13:06:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:06:14,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-10-15 13:06:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:14,676 INFO L225 Difference]: With dead ends: 26 [2018-10-15 13:06:14,676 INFO L226 Difference]: Without dead ends: 26 [2018-10-15 13:06:14,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:06:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-15 13:06:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-15 13:06:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 13:06:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 13:06:14,682 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-15 13:06:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:14,682 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 13:06:14,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:06:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 13:06:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 13:06:14,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:14,684 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:14,684 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:14,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:14,684 INFO L82 PathProgramCache]: Analyzing trace with hash -324369383, now seen corresponding path program 7 times [2018-10-15 13:06:14,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 13:06:14,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 13:06:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 13:06:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:06:14,966 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-10-15 13:06:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:15,214 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 13:06:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:06:15,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-15 13:06:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:15,216 INFO L225 Difference]: With dead ends: 28 [2018-10-15 13:06:15,216 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 13:06:15,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:06:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 13:06:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-15 13:06:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 13:06:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 13:06:15,220 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-15 13:06:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:15,220 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 13:06:15,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 13:06:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 13:06:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 13:06:15,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:15,222 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:15,222 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:15,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1888818345, now seen corresponding path program 8 times [2018-10-15 13:06:15,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:15,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:15,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:06:15,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:06:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:06:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:06:15,534 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-10-15 13:06:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:15,772 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-15 13:06:15,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:06:15,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-10-15 13:06:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:15,775 INFO L225 Difference]: With dead ends: 30 [2018-10-15 13:06:15,775 INFO L226 Difference]: Without dead ends: 30 [2018-10-15 13:06:15,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:06:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-15 13:06:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-15 13:06:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 13:06:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 13:06:15,780 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-15 13:06:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:15,780 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 13:06:15,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:06:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 13:06:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 13:06:15,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:15,782 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:15,782 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:15,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2085717227, now seen corresponding path program 9 times [2018-10-15 13:06:15,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:16,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:16,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:06:16,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:06:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:06:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:06:16,157 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-10-15 13:06:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:16,412 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-15 13:06:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:06:16,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-15 13:06:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:16,421 INFO L225 Difference]: With dead ends: 32 [2018-10-15 13:06:16,421 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 13:06:16,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:06:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 13:06:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-10-15 13:06:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 13:06:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 13:06:16,428 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-15 13:06:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:16,429 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 13:06:16,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:06:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 13:06:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 13:06:16,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:16,430 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:16,431 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:16,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:16,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1967985491, now seen corresponding path program 10 times [2018-10-15 13:06:16,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:16,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:16,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:06:16,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:06:16,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:06:16,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:06:16,861 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-10-15 13:06:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:17,308 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 13:06:17,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:06:17,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-10-15 13:06:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:17,310 INFO L225 Difference]: With dead ends: 34 [2018-10-15 13:06:17,310 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 13:06:17,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:06:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 13:06:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-15 13:06:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 13:06:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 13:06:17,315 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-15 13:06:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:17,316 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 13:06:17,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:06:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 13:06:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 13:06:17,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:17,317 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:17,317 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:17,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:17,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2040960017, now seen corresponding path program 11 times [2018-10-15 13:06:17,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:17,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:17,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:06:17,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:06:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:06:17,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:06:17,532 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-10-15 13:06:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:17,873 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 13:06:17,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 13:06:17,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-10-15 13:06:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:17,875 INFO L225 Difference]: With dead ends: 36 [2018-10-15 13:06:17,875 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 13:06:17,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:06:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 13:06:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-15 13:06:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 13:06:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 13:06:17,880 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-15 13:06:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:17,880 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 13:06:17,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:06:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 13:06:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 13:06:17,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:17,882 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:17,882 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:17,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash -844964529, now seen corresponding path program 12 times [2018-10-15 13:06:17,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:18,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:18,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:06:18,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:06:18,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:06:18,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:06:18,454 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-10-15 13:06:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:18,825 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-15 13:06:18,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:06:18,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-10-15 13:06:18,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:18,827 INFO L225 Difference]: With dead ends: 38 [2018-10-15 13:06:18,828 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 13:06:18,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:06:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 13:06:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-15 13:06:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 13:06:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 13:06:18,832 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-15 13:06:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:18,833 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 13:06:18,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:06:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 13:06:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 13:06:18,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:18,834 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:18,834 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:18,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:18,835 INFO L82 PathProgramCache]: Analyzing trace with hash 330419981, now seen corresponding path program 13 times [2018-10-15 13:06:18,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:19,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:19,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 13:06:19,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 13:06:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 13:06:19,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:06:19,185 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-10-15 13:06:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:19,757 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-15 13:06:19,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 13:06:19,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-10-15 13:06:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:19,759 INFO L225 Difference]: With dead ends: 40 [2018-10-15 13:06:19,759 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 13:06:19,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:06:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 13:06:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-15 13:06:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 13:06:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 13:06:19,764 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-15 13:06:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:19,764 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 13:06:19,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 13:06:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 13:06:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 13:06:19,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:19,765 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:19,766 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:19,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash 298535243, now seen corresponding path program 14 times [2018-10-15 13:06:19,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:20,229 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 13:06:20,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:20,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:06:20,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:06:20,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:06:20,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:06:20,231 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-10-15 13:06:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:20,646 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-15 13:06:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:06:20,647 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-10-15 13:06:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:20,648 INFO L225 Difference]: With dead ends: 42 [2018-10-15 13:06:20,648 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 13:06:20,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:06:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 13:06:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-15 13:06:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:06:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 13:06:20,653 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-15 13:06:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:20,653 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 13:06:20,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:06:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 13:06:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:06:20,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:20,654 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:20,654 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:20,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -277926903, now seen corresponding path program 15 times [2018-10-15 13:06:20,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:21,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:21,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:06:21,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:06:21,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:06:21,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:06:21,020 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-10-15 13:06:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:21,549 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 13:06:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:06:21,550 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-10-15 13:06:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:21,551 INFO L225 Difference]: With dead ends: 44 [2018-10-15 13:06:21,551 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:06:21,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:06:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:06:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-10-15 13:06:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 13:06:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 13:06:21,556 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-15 13:06:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:21,556 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 13:06:21,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:06:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 13:06:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 13:06:21,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:21,557 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:21,558 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:21,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:21,558 INFO L82 PathProgramCache]: Analyzing trace with hash -207268025, now seen corresponding path program 16 times [2018-10-15 13:06:21,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:21,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:21,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:06:21,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:06:21,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:06:21,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:06:21,921 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-10-15 13:06:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:22,984 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 13:06:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:06:22,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-10-15 13:06:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:22,986 INFO L225 Difference]: With dead ends: 46 [2018-10-15 13:06:22,986 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 13:06:22,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:06:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 13:06:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-15 13:06:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 13:06:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 13:06:22,990 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-15 13:06:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:22,990 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 13:06:22,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:06:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 13:06:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 13:06:22,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:22,991 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:22,992 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:22,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1023563003, now seen corresponding path program 17 times [2018-10-15 13:06:22,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:23,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:23,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 13:06:23,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 13:06:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 13:06:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:06:23,381 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-10-15 13:06:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:24,255 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 13:06:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 13:06:24,262 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-10-15 13:06:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:24,263 INFO L225 Difference]: With dead ends: 48 [2018-10-15 13:06:24,263 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 13:06:24,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:06:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 13:06:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-10-15 13:06:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 13:06:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 13:06:24,267 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-15 13:06:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:24,267 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 13:06:24,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 13:06:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 13:06:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 13:06:24,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:24,269 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:24,269 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:24,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 495978307, now seen corresponding path program 18 times [2018-10-15 13:06:24,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:25,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:25,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:06:25,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:06:25,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:06:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:06:25,394 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2018-10-15 13:06:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:26,070 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-15 13:06:26,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:06:26,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-10-15 13:06:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:26,071 INFO L225 Difference]: With dead ends: 50 [2018-10-15 13:06:26,071 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 13:06:26,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:06:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 13:06:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-15 13:06:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 13:06:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 13:06:26,076 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-15 13:06:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:26,077 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 13:06:26,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:06:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 13:06:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 13:06:26,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:26,078 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:26,078 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:26,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash 486296577, now seen corresponding path program 19 times [2018-10-15 13:06:26,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:26,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:26,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 13:06:26,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 13:06:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 13:06:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:06:26,825 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2018-10-15 13:06:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:27,637 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-15 13:06:27,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 13:06:27,638 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-10-15 13:06:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:27,639 INFO L225 Difference]: With dead ends: 52 [2018-10-15 13:06:27,639 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 13:06:27,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:06:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 13:06:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-15 13:06:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 13:06:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 13:06:27,643 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-15 13:06:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:27,644 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 13:06:27,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 13:06:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 13:06:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 13:06:27,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:27,645 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:27,645 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:27,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash -227911361, now seen corresponding path program 20 times [2018-10-15 13:06:27,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:28,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:28,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:06:28,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:06:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:06:28,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:06:28,039 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2018-10-15 13:06:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:28,760 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 13:06:28,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:06:28,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-10-15 13:06:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:28,762 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:06:28,762 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 13:06:28,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:06:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 13:06:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-15 13:06:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 13:06:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 13:06:28,765 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-15 13:06:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:28,766 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 13:06:28,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:06:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 13:06:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 13:06:28,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:28,766 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:28,767 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:28,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash 613027581, now seen corresponding path program 21 times [2018-10-15 13:06:28,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:29,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:29,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 13:06:29,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 13:06:29,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 13:06:29,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:06:29,244 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2018-10-15 13:06:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:30,065 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 13:06:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:06:30,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-10-15 13:06:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:30,069 INFO L225 Difference]: With dead ends: 56 [2018-10-15 13:06:30,069 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 13:06:30,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:06:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 13:06:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-10-15 13:06:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 13:06:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 13:06:30,072 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-15 13:06:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:30,072 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 13:06:30,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 13:06:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 13:06:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 13:06:30,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:30,073 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:30,073 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:30,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1301499195, now seen corresponding path program 22 times [2018-10-15 13:06:30,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:30,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:30,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:06:30,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:06:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:06:30,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:06:30,861 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2018-10-15 13:06:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:31,713 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 13:06:31,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:06:31,714 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-10-15 13:06:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:31,715 INFO L225 Difference]: With dead ends: 58 [2018-10-15 13:06:31,715 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 13:06:31,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:06:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 13:06:31,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-15 13:06:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 13:06:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-15 13:06:31,719 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-15 13:06:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:31,719 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-15 13:06:31,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:06:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-15 13:06:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 13:06:31,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:31,720 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:31,720 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:31,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:31,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1497756665, now seen corresponding path program 23 times [2018-10-15 13:06:31,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:33,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:33,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 13:06:33,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 13:06:33,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 13:06:33,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:06:33,288 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-15 13:06:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:34,280 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 13:06:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 13:06:34,281 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-15 13:06:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:34,281 INFO L225 Difference]: With dead ends: 60 [2018-10-15 13:06:34,282 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 13:06:34,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:06:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 13:06:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-15 13:06:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 13:06:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 13:06:34,285 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-15 13:06:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:34,285 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 13:06:34,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 13:06:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 13:06:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 13:06:34,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:34,286 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:34,286 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:34,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1122624311, now seen corresponding path program 24 times [2018-10-15 13:06:34,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:34,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:34,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:06:34,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:06:34,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:06:34,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:06:34,839 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2018-10-15 13:06:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:35,835 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-15 13:06:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:06:35,835 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-10-15 13:06:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:35,836 INFO L225 Difference]: With dead ends: 62 [2018-10-15 13:06:35,836 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 13:06:35,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:06:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 13:06:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-15 13:06:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:06:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 13:06:35,840 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-15 13:06:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:35,841 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 13:06:35,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:06:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 13:06:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:06:35,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:35,842 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:35,842 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:35,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1397684981, now seen corresponding path program 25 times [2018-10-15 13:06:35,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:37,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:37,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 13:06:37,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 13:06:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 13:06:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:06:37,121 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-10-15 13:06:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:38,308 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 13:06:38,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:06:38,308 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-10-15 13:06:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:38,309 INFO L225 Difference]: With dead ends: 64 [2018-10-15 13:06:38,309 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 13:06:38,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:06:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 13:06:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-15 13:06:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 13:06:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 13:06:38,313 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-15 13:06:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:38,313 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 13:06:38,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 13:06:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 13:06:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 13:06:38,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:38,314 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:38,314 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:38,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash -556983501, now seen corresponding path program 26 times [2018-10-15 13:06:38,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:38,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:38,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:06:38,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:06:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:06:38,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:06:38,926 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2018-10-15 13:06:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:40,117 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-15 13:06:40,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:06:40,117 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-10-15 13:06:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:40,118 INFO L225 Difference]: With dead ends: 66 [2018-10-15 13:06:40,118 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 13:06:40,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:06:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 13:06:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-15 13:06:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 13:06:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 13:06:40,121 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-15 13:06:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:40,122 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 13:06:40,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:06:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 13:06:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 13:06:40,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:40,123 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:40,123 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:40,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:40,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2092686351, now seen corresponding path program 27 times [2018-10-15 13:06:40,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:40,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:40,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 13:06:40,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 13:06:40,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 13:06:40,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:06:40,867 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2018-10-15 13:06:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:42,134 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 13:06:42,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:06:42,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-10-15 13:06:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:42,137 INFO L225 Difference]: With dead ends: 68 [2018-10-15 13:06:42,137 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 13:06:42,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:06:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 13:06:42,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-10-15 13:06:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 13:06:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 13:06:42,139 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-15 13:06:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:42,140 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 13:06:42,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 13:06:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 13:06:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 13:06:42,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:42,140 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:42,141 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:42,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash -434375377, now seen corresponding path program 28 times [2018-10-15 13:06:42,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:43,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:43,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:06:43,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:06:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:06:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:06:43,105 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2018-10-15 13:06:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:44,422 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-15 13:06:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:06:44,422 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-10-15 13:06:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:44,423 INFO L225 Difference]: With dead ends: 70 [2018-10-15 13:06:44,424 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 13:06:44,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:06:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 13:06:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-15 13:06:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 13:06:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-15 13:06:44,427 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-15 13:06:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:44,427 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-15 13:06:44,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:06:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-15 13:06:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 13:06:44,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:44,428 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:44,428 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:44,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -230396179, now seen corresponding path program 29 times [2018-10-15 13:06:44,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:45,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:45,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 13:06:45,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 13:06:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 13:06:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:06:45,078 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2018-10-15 13:06:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:46,482 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 13:06:46,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 13:06:46,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-10-15 13:06:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:46,484 INFO L225 Difference]: With dead ends: 72 [2018-10-15 13:06:46,484 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 13:06:46,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:06:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 13:06:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-10-15 13:06:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 13:06:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 13:06:46,488 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-15 13:06:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:46,488 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 13:06:46,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 13:06:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 13:06:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 13:06:46,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:46,489 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:46,489 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:46,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1774882517, now seen corresponding path program 30 times [2018-10-15 13:06:46,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:47,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:47,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:06:47,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:06:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:06:47,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:06:47,683 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2018-10-15 13:06:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:49,325 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 13:06:49,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:06:49,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-10-15 13:06:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:49,327 INFO L225 Difference]: With dead ends: 74 [2018-10-15 13:06:49,327 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 13:06:49,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:06:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 13:06:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-15 13:06:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 13:06:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 13:06:49,330 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-15 13:06:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:49,331 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 13:06:49,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:06:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 13:06:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 13:06:49,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:49,331 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:49,332 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:49,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash 32431081, now seen corresponding path program 31 times [2018-10-15 13:06:49,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:50,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:50,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 13:06:50,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 13:06:50,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 13:06:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:06:50,845 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2018-10-15 13:06:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:52,425 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 13:06:52,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 13:06:52,425 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-10-15 13:06:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:52,426 INFO L225 Difference]: With dead ends: 76 [2018-10-15 13:06:52,426 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 13:06:52,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:06:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 13:06:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-15 13:06:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 13:06:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 13:06:52,431 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-15 13:06:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:52,431 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 13:06:52,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 13:06:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 13:06:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 13:06:52,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:52,432 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:52,432 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:52,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1694011175, now seen corresponding path program 32 times [2018-10-15 13:06:52,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:53,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:53,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:06:53,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:06:53,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:06:53,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:06:53,584 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2018-10-15 13:06:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:55,270 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 13:06:55,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:06:55,270 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-10-15 13:06:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:55,271 INFO L225 Difference]: With dead ends: 78 [2018-10-15 13:06:55,271 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 13:06:55,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:06:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 13:06:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-15 13:06:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 13:06:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-15 13:06:55,276 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-10-15 13:06:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:55,276 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-15 13:06:55,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:06:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-15 13:06:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 13:06:55,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:55,277 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:55,277 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:55,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash 744647397, now seen corresponding path program 33 times [2018-10-15 13:06:55,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:56,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:56,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 13:06:56,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 13:06:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 13:06:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:06:56,485 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2018-10-15 13:06:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:58,482 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-15 13:06:58,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:06:58,482 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-10-15 13:06:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:58,483 INFO L225 Difference]: With dead ends: 80 [2018-10-15 13:06:58,483 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 13:06:58,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:06:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 13:06:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-10-15 13:06:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 13:06:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 13:06:58,488 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-10-15 13:06:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:58,488 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 13:06:58,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 13:06:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 13:06:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 13:06:58,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:58,489 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:58,489 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:58,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1060876509, now seen corresponding path program 34 times [2018-10-15 13:06:58,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:59,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:59,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:06:59,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:06:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:06:59,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:06:59,471 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2018-10-15 13:07:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:01,362 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 13:07:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:07:01,363 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-10-15 13:07:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:01,364 INFO L225 Difference]: With dead ends: 82 [2018-10-15 13:07:01,364 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 13:07:01,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:07:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 13:07:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-15 13:07:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 13:07:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 13:07:01,367 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-10-15 13:07:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:01,367 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 13:07:01,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:07:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 13:07:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 13:07:01,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:01,368 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:01,368 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:01,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1002562591, now seen corresponding path program 35 times [2018-10-15 13:07:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:02,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:02,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 13:07:02,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 13:07:02,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 13:07:02,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:07:02,423 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2018-10-15 13:07:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:04,542 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 13:07:04,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:07:04,543 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-10-15 13:07:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:04,544 INFO L225 Difference]: With dead ends: 84 [2018-10-15 13:07:04,545 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 13:07:04,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:07:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 13:07:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-10-15 13:07:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 13:07:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 13:07:04,548 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-10-15 13:07:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:04,549 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 13:07:04,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 13:07:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 13:07:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 13:07:04,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:04,549 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:04,550 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:04,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:04,550 INFO L82 PathProgramCache]: Analyzing trace with hash -797462241, now seen corresponding path program 36 times [2018-10-15 13:07:04,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:05,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:05,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:07:05,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:07:05,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:07:05,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:07:05,864 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2018-10-15 13:07:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:07,979 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-15 13:07:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:07:07,980 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-10-15 13:07:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:07,981 INFO L225 Difference]: With dead ends: 86 [2018-10-15 13:07:07,981 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 13:07:07,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:07:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 13:07:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-15 13:07:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 13:07:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 13:07:07,985 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-10-15 13:07:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:07,986 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 13:07:07,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:07:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 13:07:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 13:07:07,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:07,987 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:07,987 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:07,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:07,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1264521507, now seen corresponding path program 37 times [2018-10-15 13:07:07,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:09,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:09,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 13:07:09,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 13:07:09,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 13:07:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:07:09,167 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2018-10-15 13:07:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:11,397 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 13:07:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 13:07:11,398 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-10-15 13:07:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:11,399 INFO L225 Difference]: With dead ends: 88 [2018-10-15 13:07:11,399 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 13:07:11,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:07:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 13:07:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-15 13:07:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 13:07:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 13:07:11,403 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-10-15 13:07:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:11,403 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 13:07:11,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 13:07:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 13:07:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 13:07:11,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:11,404 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:11,404 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:11,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash 863089947, now seen corresponding path program 38 times [2018-10-15 13:07:11,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:12,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:07:12,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:07:12,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:07:12,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:07:12,625 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2018-10-15 13:07:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:15,129 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 13:07:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:07:15,129 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-10-15 13:07:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:15,130 INFO L225 Difference]: With dead ends: 90 [2018-10-15 13:07:15,130 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 13:07:15,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:07:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 13:07:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-15 13:07:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 13:07:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-15 13:07:15,134 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-10-15 13:07:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:15,135 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-15 13:07:15,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:07:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-15 13:07:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 13:07:15,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:15,136 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:15,136 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:15,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1093264345, now seen corresponding path program 39 times [2018-10-15 13:07:15,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:16,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:16,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 13:07:16,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 13:07:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 13:07:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:07:16,177 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2018-10-15 13:07:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:18,775 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-15 13:07:18,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:07:18,775 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-10-15 13:07:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:18,776 INFO L225 Difference]: With dead ends: 92 [2018-10-15 13:07:18,776 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 13:07:18,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:07:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 13:07:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-10-15 13:07:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 13:07:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 13:07:18,779 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-10-15 13:07:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:18,780 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 13:07:18,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 13:07:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 13:07:18,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 13:07:18,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:18,780 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:18,780 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:18,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:18,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1047438569, now seen corresponding path program 40 times [2018-10-15 13:07:18,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:07:20,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:07:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:07:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:07:20,045 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2018-10-15 13:07:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:22,599 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 13:07:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:07:22,600 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-10-15 13:07:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:22,601 INFO L225 Difference]: With dead ends: 94 [2018-10-15 13:07:22,601 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 13:07:22,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:07:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 13:07:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-15 13:07:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 13:07:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 13:07:22,605 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-10-15 13:07:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:22,605 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 13:07:22,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:07:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 13:07:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 13:07:22,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:22,606 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:22,607 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:22,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash -973604139, now seen corresponding path program 41 times [2018-10-15 13:07:22,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:24,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:24,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 13:07:24,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 13:07:24,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 13:07:24,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:07:24,269 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2018-10-15 13:07:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:26,931 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-15 13:07:26,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:07:26,932 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2018-10-15 13:07:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:26,933 INFO L225 Difference]: With dead ends: 96 [2018-10-15 13:07:26,933 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 13:07:26,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:07:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 13:07:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-10-15 13:07:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 13:07:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 13:07:26,936 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-10-15 13:07:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:26,937 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 13:07:26,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 13:07:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 13:07:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 13:07:26,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:26,937 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:26,938 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:26,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1261806355, now seen corresponding path program 42 times [2018-10-15 13:07:26,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:28,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:28,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:07:28,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:07:28,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:07:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:07:28,167 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2018-10-15 13:07:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:31,127 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-15 13:07:31,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:07:31,128 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2018-10-15 13:07:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:31,129 INFO L225 Difference]: With dead ends: 98 [2018-10-15 13:07:31,129 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 13:07:31,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:07:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 13:07:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-15 13:07:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 13:07:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 13:07:31,133 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-10-15 13:07:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:31,133 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 13:07:31,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:07:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 13:07:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 13:07:31,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:31,134 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:31,134 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:31,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:31,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2007643089, now seen corresponding path program 43 times [2018-10-15 13:07:31,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:32,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:32,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 13:07:32,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 13:07:32,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 13:07:32,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:07:32,316 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2018-10-15 13:07:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:35,401 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-15 13:07:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 13:07:35,402 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2018-10-15 13:07:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:35,403 INFO L225 Difference]: With dead ends: 100 [2018-10-15 13:07:35,403 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 13:07:35,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:07:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 13:07:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-10-15 13:07:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 13:07:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 13:07:35,406 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-10-15 13:07:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:35,407 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 13:07:35,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 13:07:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 13:07:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 13:07:35,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:35,407 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:35,408 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:35,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1497206031, now seen corresponding path program 44 times [2018-10-15 13:07:35,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:36,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:36,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:07:36,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:07:36,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:07:36,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:07:36,863 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2018-10-15 13:07:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:40,115 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 13:07:40,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:07:40,116 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2018-10-15 13:07:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:40,117 INFO L225 Difference]: With dead ends: 102 [2018-10-15 13:07:40,117 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 13:07:40,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:07:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 13:07:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-15 13:07:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 13:07:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 13:07:40,121 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-10-15 13:07:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:40,121 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 13:07:40,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:07:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 13:07:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:07:40,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:40,122 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:40,122 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:40,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash 593465037, now seen corresponding path program 45 times [2018-10-15 13:07:40,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:41,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:41,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 13:07:41,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 13:07:41,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 13:07:41,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:07:41,463 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2018-10-15 13:07:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:44,803 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 13:07:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:07:44,804 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2018-10-15 13:07:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:44,805 INFO L225 Difference]: With dead ends: 104 [2018-10-15 13:07:44,805 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 13:07:44,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:07:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 13:07:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-10-15 13:07:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 13:07:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 13:07:44,809 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-10-15 13:07:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:44,809 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 13:07:44,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 13:07:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 13:07:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 13:07:44,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:44,810 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:44,811 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:44,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash -318236405, now seen corresponding path program 46 times [2018-10-15 13:07:44,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:46,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:46,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:07:46,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:07:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:07:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:07:46,145 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2018-10-15 13:07:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:49,596 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 13:07:49,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:07:49,596 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2018-10-15 13:07:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:49,597 INFO L225 Difference]: With dead ends: 106 [2018-10-15 13:07:49,597 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 13:07:49,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:07:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 13:07:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-15 13:07:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 13:07:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-15 13:07:49,601 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-10-15 13:07:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:49,601 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-15 13:07:49,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:07:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-15 13:07:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 13:07:49,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:49,602 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:49,602 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:49,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash -289993783, now seen corresponding path program 47 times [2018-10-15 13:07:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:51,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:51,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 13:07:51,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 13:07:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 13:07:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:07:51,863 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2018-10-15 13:07:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:55,565 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 13:07:55,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:07:55,568 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2018-10-15 13:07:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:55,569 INFO L225 Difference]: With dead ends: 108 [2018-10-15 13:07:55,569 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 13:07:55,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:07:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 13:07:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-10-15 13:07:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 13:07:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 13:07:55,573 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-10-15 13:07:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:55,573 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 13:07:55,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 13:07:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 13:07:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 13:07:55,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:55,574 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:55,574 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:55,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:55,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1081362183, now seen corresponding path program 48 times [2018-10-15 13:07:55,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:57,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:57,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:07:57,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:07:57,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:07:57,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:07:57,226 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2018-10-15 13:08:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:01,008 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-15 13:08:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:08:01,009 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2018-10-15 13:08:01,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:01,010 INFO L225 Difference]: With dead ends: 110 [2018-10-15 13:08:01,010 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 13:08:01,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:08:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 13:08:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-15 13:08:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 13:08:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 13:08:01,014 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-10-15 13:08:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:01,014 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 13:08:01,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:08:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 13:08:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 13:08:01,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:01,015 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:01,015 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:01,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:01,016 INFO L82 PathProgramCache]: Analyzing trace with hash 399485637, now seen corresponding path program 49 times [2018-10-15 13:08:01,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:03,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:03,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 13:08:03,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 13:08:03,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 13:08:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:08:03,039 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2018-10-15 13:08:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:06,948 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 13:08:06,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:08:06,948 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2018-10-15 13:08:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:06,950 INFO L225 Difference]: With dead ends: 112 [2018-10-15 13:08:06,950 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 13:08:06,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:08:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 13:08:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-10-15 13:08:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 13:08:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 13:08:06,953 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-10-15 13:08:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:06,954 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 13:08:06,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 13:08:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 13:08:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 13:08:06,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:06,955 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:06,955 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:06,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2048846077, now seen corresponding path program 50 times [2018-10-15 13:08:06,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:08,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:08,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:08:08,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:08:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:08:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:08:08,394 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2018-10-15 13:08:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:12,430 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 13:08:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:08:12,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2018-10-15 13:08:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:12,432 INFO L225 Difference]: With dead ends: 114 [2018-10-15 13:08:12,433 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 13:08:12,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:08:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 13:08:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-15 13:08:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 13:08:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-15 13:08:12,436 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-10-15 13:08:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:12,436 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-15 13:08:12,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:08:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-15 13:08:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 13:08:12,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:12,437 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:12,438 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:12,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:12,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1253545023, now seen corresponding path program 51 times [2018-10-15 13:08:12,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:14,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:14,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 13:08:14,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 13:08:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 13:08:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:08:14,105 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2018-10-15 13:08:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:18,848 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-15 13:08:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:08:18,849 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2018-10-15 13:08:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:18,850 INFO L225 Difference]: With dead ends: 116 [2018-10-15 13:08:18,850 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 13:08:18,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:08:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 13:08:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-10-15 13:08:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 13:08:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 13:08:18,853 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-10-15 13:08:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:18,854 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 13:08:18,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 13:08:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 13:08:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 13:08:18,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:18,855 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:18,855 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:18,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:18,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1473410817, now seen corresponding path program 52 times [2018-10-15 13:08:18,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:20,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:08:20,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:08:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:08:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:08:20,736 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2018-10-15 13:08:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:25,120 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 13:08:25,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:08:25,120 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2018-10-15 13:08:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:25,121 INFO L225 Difference]: With dead ends: 118 [2018-10-15 13:08:25,121 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 13:08:25,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:08:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 13:08:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-15 13:08:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 13:08:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 13:08:25,125 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-10-15 13:08:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:25,125 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 13:08:25,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:08:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 13:08:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 13:08:25,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:25,126 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:25,126 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:25,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1983925949, now seen corresponding path program 53 times [2018-10-15 13:08:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:26,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:26,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 13:08:26,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 13:08:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 13:08:26,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:08:26,713 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2018-10-15 13:08:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:31,349 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-15 13:08:31,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:08:31,349 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2018-10-15 13:08:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:31,350 INFO L225 Difference]: With dead ends: 120 [2018-10-15 13:08:31,351 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 13:08:31,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:08:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 13:08:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-10-15 13:08:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 13:08:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 13:08:31,354 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-10-15 13:08:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:31,354 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 13:08:31,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 13:08:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 13:08:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:08:31,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:31,355 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:31,356 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:31,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:31,356 INFO L82 PathProgramCache]: Analyzing trace with hash 179870971, now seen corresponding path program 54 times [2018-10-15 13:08:31,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:33,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:33,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:08:33,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:08:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:08:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:08:33,529 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2018-10-15 13:08:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:38,221 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-15 13:08:38,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:08:38,222 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2018-10-15 13:08:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:38,223 INFO L225 Difference]: With dead ends: 122 [2018-10-15 13:08:38,223 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 13:08:38,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:08:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 13:08:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-15 13:08:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 13:08:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 13:08:38,226 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-10-15 13:08:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:38,226 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 13:08:38,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:08:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 13:08:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 13:08:38,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:38,227 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:38,228 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:38,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1649824697, now seen corresponding path program 55 times [2018-10-15 13:08:38,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:40,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:40,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 13:08:40,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 13:08:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 13:08:40,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:08:40,238 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2018-10-15 13:08:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:45,022 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 13:08:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 13:08:45,022 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2018-10-15 13:08:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:45,023 INFO L225 Difference]: With dead ends: 124 [2018-10-15 13:08:45,024 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 13:08:45,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:08:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 13:08:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-15 13:08:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 13:08:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 13:08:45,026 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-10-15 13:08:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:45,027 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 13:08:45,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 13:08:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 13:08:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 13:08:45,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:45,028 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:45,028 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:45,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1231114999, now seen corresponding path program 56 times [2018-10-15 13:08:45,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:47,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:47,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:08:47,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:08:47,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:08:47,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:08:47,046 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2018-10-15 13:08:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:52,053 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 13:08:52,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:08:52,054 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2018-10-15 13:08:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:52,055 INFO L225 Difference]: With dead ends: 126 [2018-10-15 13:08:52,055 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 13:08:52,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:08:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 13:08:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-15 13:08:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 13:08:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-15 13:08:52,058 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-10-15 13:08:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:52,059 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-15 13:08:52,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:08:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-15 13:08:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:08:52,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:52,060 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:52,060 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:52,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:52,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1716946251, now seen corresponding path program 57 times [2018-10-15 13:08:52,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:54,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:54,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 13:08:54,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 13:08:54,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 13:08:54,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:08:54,729 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2018-10-15 13:08:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:59,773 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 13:08:59,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:08:59,773 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2018-10-15 13:08:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:59,774 INFO L225 Difference]: With dead ends: 128 [2018-10-15 13:08:59,774 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 13:08:59,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:08:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 13:08:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-10-15 13:08:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 13:08:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 13:08:59,776 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-10-15 13:08:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:59,776 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 13:08:59,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 13:08:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 13:08:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 13:08:59,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:59,777 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:59,777 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:59,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash -125392141, now seen corresponding path program 58 times [2018-10-15 13:08:59,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:01,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:01,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:09:01,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:09:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:09:01,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:09:01,988 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2018-10-15 13:09:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:07,151 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 13:09:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:09:07,151 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2018-10-15 13:09:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:07,152 INFO L225 Difference]: With dead ends: 130 [2018-10-15 13:09:07,153 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 13:09:07,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:09:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 13:09:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-15 13:09:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 13:09:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-15 13:09:07,156 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-10-15 13:09:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:07,156 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-15 13:09:07,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:09:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-15 13:09:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 13:09:07,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:07,157 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:07,157 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:07,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash 349750193, now seen corresponding path program 59 times [2018-10-15 13:09:07,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:09,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:09,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 13:09:09,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 13:09:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 13:09:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:09:09,017 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2018-10-15 13:09:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:14,327 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 13:09:14,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:09:14,328 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2018-10-15 13:09:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:14,329 INFO L225 Difference]: With dead ends: 132 [2018-10-15 13:09:14,329 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 13:09:14,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:09:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 13:09:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-15 13:09:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 13:09:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 13:09:14,333 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-10-15 13:09:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:14,333 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 13:09:14,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 13:09:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 13:09:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:09:14,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:14,334 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:14,334 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:14,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:14,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1694999791, now seen corresponding path program 60 times [2018-10-15 13:09:14,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:16,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:16,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:09:16,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:09:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:09:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:09:16,468 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2018-10-15 13:09:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:21,943 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 13:09:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:09:21,944 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2018-10-15 13:09:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:21,945 INFO L225 Difference]: With dead ends: 134 [2018-10-15 13:09:21,945 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 13:09:21,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:09:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 13:09:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-15 13:09:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 13:09:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 13:09:21,948 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-10-15 13:09:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:21,948 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 13:09:21,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:09:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 13:09:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 13:09:21,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:21,949 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:21,950 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:21,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1694707373, now seen corresponding path program 61 times [2018-10-15 13:09:21,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:23,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:23,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 13:09:23,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 13:09:23,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 13:09:23,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:09:23,911 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2018-10-15 13:09:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:29,530 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-15 13:09:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 13:09:29,531 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2018-10-15 13:09:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:29,532 INFO L225 Difference]: With dead ends: 136 [2018-10-15 13:09:29,532 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 13:09:29,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:09:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 13:09:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-10-15 13:09:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 13:09:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 13:09:29,535 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-10-15 13:09:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:29,536 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 13:09:29,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 13:09:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 13:09:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 13:09:29,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:29,536 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:29,537 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:29,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1413693675, now seen corresponding path program 62 times [2018-10-15 13:09:29,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:31,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:31,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:09:31,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:09:31,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:09:31,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:09:31,853 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2018-10-15 13:09:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:37,650 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 13:09:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:09:37,650 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2018-10-15 13:09:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:37,651 INFO L225 Difference]: With dead ends: 138 [2018-10-15 13:09:37,651 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 13:09:37,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:09:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 13:09:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-15 13:09:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 13:09:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 13:09:37,654 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-10-15 13:09:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:37,655 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 13:09:37,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:09:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 13:09:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:09:37,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:37,655 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:37,656 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:37,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:37,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1942469545, now seen corresponding path program 63 times [2018-10-15 13:09:37,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:39,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:39,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 13:09:39,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 13:09:39,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 13:09:39,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:09:39,753 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2018-10-15 13:09:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:45,779 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-15 13:09:45,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:09:45,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2018-10-15 13:09:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:45,781 INFO L225 Difference]: With dead ends: 140 [2018-10-15 13:09:45,781 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 13:09:45,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:09:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 13:09:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-10-15 13:09:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 13:09:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 13:09:45,784 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-10-15 13:09:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:45,784 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 13:09:45,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 13:09:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 13:09:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 13:09:45,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:45,785 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:45,785 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:45,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1005027609, now seen corresponding path program 64 times [2018-10-15 13:09:45,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:48,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:48,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:09:48,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:09:48,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:09:48,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:09:48,314 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2018-10-15 13:09:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:54,488 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-15 13:09:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:09:54,489 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2018-10-15 13:09:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:54,490 INFO L225 Difference]: With dead ends: 142 [2018-10-15 13:09:54,490 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 13:09:54,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:09:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 13:09:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-15 13:09:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 13:09:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 13:09:54,493 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-10-15 13:09:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:54,493 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 13:09:54,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:09:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 13:09:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 13:09:54,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:54,495 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:54,495 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:54,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:54,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1128622757, now seen corresponding path program 65 times [2018-10-15 13:09:54,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:56,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:56,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 13:09:56,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 13:09:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 13:09:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:09:56,759 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2018-10-15 13:10:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:03,281 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 13:10:03,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:10:03,282 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2018-10-15 13:10:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:03,283 INFO L225 Difference]: With dead ends: 144 [2018-10-15 13:10:03,283 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 13:10:03,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:10:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 13:10:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-10-15 13:10:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 13:10:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 13:10:03,285 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-10-15 13:10:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:03,286 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 13:10:03,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 13:10:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 13:10:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:10:03,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:03,286 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:03,287 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:03,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1427743005, now seen corresponding path program 66 times [2018-10-15 13:10:03,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:05,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:05,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:10:05,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:10:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:10:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:10:05,501 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2018-10-15 13:10:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:12,082 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-15 13:10:12,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:10:12,082 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2018-10-15 13:10:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:12,084 INFO L225 Difference]: With dead ends: 146 [2018-10-15 13:10:12,084 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 13:10:12,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:10:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 13:10:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-15 13:10:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 13:10:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 13:10:12,087 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-10-15 13:10:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:12,088 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 13:10:12,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:10:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 13:10:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 13:10:12,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:12,089 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:12,089 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:12,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:12,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1373946975, now seen corresponding path program 67 times [2018-10-15 13:10:12,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:14,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:14,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 13:10:14,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 13:10:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 13:10:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:10:14,652 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 70 states. [2018-10-15 13:10:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:21,359 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 13:10:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 13:10:21,360 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2018-10-15 13:10:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:21,361 INFO L225 Difference]: With dead ends: 148 [2018-10-15 13:10:21,361 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 13:10:21,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:10:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 13:10:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-10-15 13:10:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 13:10:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 13:10:21,365 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-10-15 13:10:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:21,365 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 13:10:21,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 13:10:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 13:10:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 13:10:21,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:21,366 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:21,367 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:21,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1215569697, now seen corresponding path program 68 times [2018-10-15 13:10:21,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:24,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:24,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:10:24,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:10:24,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:10:24,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:10:24,042 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2018-10-15 13:10:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:31,033 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-15 13:10:31,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:10:31,038 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2018-10-15 13:10:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:31,039 INFO L225 Difference]: With dead ends: 150 [2018-10-15 13:10:31,039 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 13:10:31,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:10:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 13:10:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-15 13:10:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-15 13:10:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-15 13:10:31,042 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-10-15 13:10:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:31,042 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-15 13:10:31,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:10:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-15 13:10:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:10:31,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:31,043 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:31,043 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:31,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:31,044 INFO L82 PathProgramCache]: Analyzing trace with hash 661139101, now seen corresponding path program 69 times [2018-10-15 13:10:31,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:33,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:33,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 13:10:33,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 13:10:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 13:10:33,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:10:33,642 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 72 states. [2018-10-15 13:10:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:40,747 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-15 13:10:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:10:40,747 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2018-10-15 13:10:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:40,748 INFO L225 Difference]: With dead ends: 152 [2018-10-15 13:10:40,748 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 13:10:40,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:10:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 13:10:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-10-15 13:10:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 13:10:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 13:10:40,752 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-10-15 13:10:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:40,752 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 13:10:40,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 13:10:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 13:10:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 13:10:40,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:40,753 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:40,753 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:40,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash 292029659, now seen corresponding path program 70 times [2018-10-15 13:10:40,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:43,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:43,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:10:43,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:10:43,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:10:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:10:43,651 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2018-10-15 13:10:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:50,997 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 13:10:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:10:50,998 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2018-10-15 13:10:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:50,999 INFO L225 Difference]: With dead ends: 154 [2018-10-15 13:10:50,999 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 13:10:51,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:10:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 13:10:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-15 13:10:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 13:10:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 13:10:51,002 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-10-15 13:10:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:51,002 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 13:10:51,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:10:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 13:10:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 13:10:51,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:51,003 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:51,003 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:51,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2060141465, now seen corresponding path program 71 times [2018-10-15 13:10:51,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:53,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:53,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 13:10:53,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 13:10:53,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 13:10:53,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:10:53,882 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 74 states. [2018-10-15 13:11:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:01,293 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-15 13:11:01,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:11:01,293 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2018-10-15 13:11:01,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:01,295 INFO L225 Difference]: With dead ends: 156 [2018-10-15 13:11:01,295 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 13:11:01,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:11:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 13:11:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-10-15 13:11:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 13:11:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 13:11:01,298 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-10-15 13:11:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:01,299 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 13:11:01,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 13:11:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 13:11:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:11:01,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:01,300 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:01,300 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:01,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash 408537815, now seen corresponding path program 72 times [2018-10-15 13:11:01,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:04,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:04,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:11:04,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:11:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:11:04,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:11:04,173 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2018-10-15 13:11:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:11,877 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-15 13:11:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:11:11,878 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2018-10-15 13:11:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:11,879 INFO L225 Difference]: With dead ends: 158 [2018-10-15 13:11:11,879 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 13:11:11,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:11:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 13:11:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-15 13:11:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 13:11:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 13:11:11,882 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-10-15 13:11:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:11,882 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 13:11:11,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:11:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 13:11:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 13:11:11,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:11,883 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:11,883 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:11,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1939637611, now seen corresponding path program 73 times [2018-10-15 13:11:11,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:14,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:14,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 13:11:14,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 13:11:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 13:11:14,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:11:14,824 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 76 states. [2018-10-15 13:11:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:22,711 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-15 13:11:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 13:11:22,712 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2018-10-15 13:11:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:22,713 INFO L225 Difference]: With dead ends: 160 [2018-10-15 13:11:22,713 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 13:11:22,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:11:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 13:11:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-10-15 13:11:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 13:11:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-15 13:11:22,717 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-10-15 13:11:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:22,718 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-15 13:11:22,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 13:11:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-15 13:11:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 13:11:22,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:22,719 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:22,719 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:22,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:22,719 INFO L82 PathProgramCache]: Analyzing trace with hash 616575699, now seen corresponding path program 74 times [2018-10-15 13:11:22,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:25,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:11:25,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:11:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:11:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:11:25,775 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2018-10-15 13:11:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:33,887 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 13:11:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:11:33,887 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2018-10-15 13:11:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:33,888 INFO L225 Difference]: With dead ends: 162 [2018-10-15 13:11:33,888 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 13:11:33,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:11:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 13:11:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-15 13:11:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 13:11:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 13:11:33,891 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-10-15 13:11:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:33,891 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 13:11:33,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:11:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 13:11:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:11:33,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:33,892 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:33,893 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:33,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 416273297, now seen corresponding path program 75 times [2018-10-15 13:11:33,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:37,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:37,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 13:11:37,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 13:11:37,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 13:11:37,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:11:37,114 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 78 states. [2018-10-15 13:11:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:45,902 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 13:11:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:11:45,902 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2018-10-15 13:11:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:45,903 INFO L225 Difference]: With dead ends: 164 [2018-10-15 13:11:45,903 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 13:11:45,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:11:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 13:11:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-10-15 13:11:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 13:11:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 13:11:45,906 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-10-15 13:11:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:45,907 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 13:11:45,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 13:11:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 13:11:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 13:11:45,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:45,908 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:45,908 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:45,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1199193295, now seen corresponding path program 76 times [2018-10-15 13:11:45,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:49,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:49,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:11:49,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:11:49,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:11:49,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:11:49,033 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2018-10-15 13:11:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:58,334 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 13:11:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:11:58,335 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2018-10-15 13:11:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:58,336 INFO L225 Difference]: With dead ends: 166 [2018-10-15 13:11:58,336 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 13:11:58,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:11:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 13:11:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-15 13:11:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 13:11:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-15 13:11:58,339 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-10-15 13:11:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:58,339 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-15 13:11:58,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:11:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-15 13:11:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 13:11:58,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:58,340 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:58,340 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:58,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1966034573, now seen corresponding path program 77 times [2018-10-15 13:11:58,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:02,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:02,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 13:12:02,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 13:12:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 13:12:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:12:02,052 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 80 states. [2018-10-15 13:12:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:12,258 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-15 13:12:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:12:12,258 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2018-10-15 13:12:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:12,260 INFO L225 Difference]: With dead ends: 168 [2018-10-15 13:12:12,260 INFO L226 Difference]: Without dead ends: 168 [2018-10-15 13:12:12,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:12:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-15 13:12:12,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-10-15 13:12:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-15 13:12:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-15 13:12:12,263 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-10-15 13:12:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:12,263 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-15 13:12:12,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 13:12:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-15 13:12:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:12:12,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:12,264 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:12,264 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:12,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash 166127819, now seen corresponding path program 78 times [2018-10-15 13:12:12,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:16,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:16,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:12:16,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:12:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:12:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:12:16,821 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2018-10-15 13:12:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:25,788 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-15 13:12:25,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:12:25,789 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2018-10-15 13:12:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:25,790 INFO L225 Difference]: With dead ends: 170 [2018-10-15 13:12:25,790 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 13:12:25,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:12:25,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 13:12:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-15 13:12:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 13:12:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-15 13:12:25,793 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-10-15 13:12:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:25,794 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-15 13:12:25,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:12:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-15 13:12:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 13:12:25,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:25,794 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:25,795 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:25,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:25,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1327557513, now seen corresponding path program 79 times [2018-10-15 13:12:25,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:29,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:29,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 13:12:29,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 13:12:29,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 13:12:29,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:12:29,161 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 82 states. [2018-10-15 13:12:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:38,470 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-15 13:12:38,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 13:12:38,470 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2018-10-15 13:12:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:38,471 INFO L225 Difference]: With dead ends: 172 [2018-10-15 13:12:38,472 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 13:12:38,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:12:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 13:12:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-10-15 13:12:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 13:12:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 13:12:38,475 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-10-15 13:12:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:38,475 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 13:12:38,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 13:12:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 13:12:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 13:12:38,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:38,476 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:38,476 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:38,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:38,477 INFO L82 PathProgramCache]: Analyzing trace with hash 769996487, now seen corresponding path program 80 times [2018-10-15 13:12:38,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:42,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:42,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:12:42,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:12:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:12:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:12:42,188 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2018-10-15 13:12:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:51,506 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 13:12:51,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:12:51,509 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2018-10-15 13:12:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:51,511 INFO L225 Difference]: With dead ends: 174 [2018-10-15 13:12:51,511 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 13:12:51,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:12:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 13:12:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-15 13:12:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 13:12:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 13:12:51,513 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-10-15 13:12:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:51,514 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 13:12:51,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:12:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 13:12:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:12:51,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:51,515 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:51,515 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:51,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1824762501, now seen corresponding path program 81 times [2018-10-15 13:12:51,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:54,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:54,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 13:12:54,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 13:12:54,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 13:12:54,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:12:54,914 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 84 states. [2018-10-15 13:13:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:04,781 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-15 13:13:04,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:13:04,781 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2018-10-15 13:13:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:04,783 INFO L225 Difference]: With dead ends: 176 [2018-10-15 13:13:04,783 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 13:13:04,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:13:04,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 13:13:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-10-15 13:13:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 13:13:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 13:13:04,787 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-10-15 13:13:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:04,787 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 13:13:04,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 13:13:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 13:13:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 13:13:04,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:04,788 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:04,788 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:04,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1842620099, now seen corresponding path program 82 times [2018-10-15 13:13:04,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:11,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:11,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:13:11,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:13:11,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:13:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:13:11,007 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2018-10-15 13:13:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:21,370 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 13:13:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:13:21,371 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2018-10-15 13:13:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:21,372 INFO L225 Difference]: With dead ends: 178 [2018-10-15 13:13:21,372 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 13:13:21,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:13:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 13:13:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-15 13:13:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 13:13:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-15 13:13:21,374 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-10-15 13:13:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:21,374 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-15 13:13:21,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:13:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-15 13:13:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 13:13:21,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:21,375 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:21,375 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:21,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1823902593, now seen corresponding path program 83 times [2018-10-15 13:13:21,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:24,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:24,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 13:13:24,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 13:13:24,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 13:13:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:13:24,948 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 86 states. [2018-10-15 13:13:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:35,175 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-15 13:13:35,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 13:13:35,176 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2018-10-15 13:13:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:35,177 INFO L225 Difference]: With dead ends: 180 [2018-10-15 13:13:35,177 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 13:13:35,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:13:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 13:13:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-10-15 13:13:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 13:13:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-15 13:13:35,180 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-10-15 13:13:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:35,181 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-15 13:13:35,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 13:13:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-15 13:13:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:13:35,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:35,182 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:35,182 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:35,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1016248511, now seen corresponding path program 84 times [2018-10-15 13:13:35,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:38,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:38,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:13:38,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:13:38,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:13:38,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:13:38,903 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2018-10-15 13:13:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:49,329 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-15 13:13:49,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:13:49,329 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2018-10-15 13:13:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:49,330 INFO L225 Difference]: With dead ends: 182 [2018-10-15 13:13:49,331 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 13:13:49,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:13:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 13:13:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-15 13:13:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 13:13:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 13:13:49,334 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-10-15 13:13:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:49,334 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 13:13:49,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:13:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 13:13:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 13:13:49,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:49,335 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:49,335 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:49,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2045211011, now seen corresponding path program 85 times [2018-10-15 13:13:49,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:52,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:52,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 13:13:52,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 13:13:52,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 13:13:52,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:13:52,822 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 88 states. [2018-10-15 13:14:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:03,866 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 13:14:03,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 13:14:03,867 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2018-10-15 13:14:03,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:03,868 INFO L225 Difference]: With dead ends: 184 [2018-10-15 13:14:03,868 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:14:03,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:14:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:14:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-10-15 13:14:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 13:14:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 13:14:03,872 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-10-15 13:14:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:03,872 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 13:14:03,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 13:14:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 13:14:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 13:14:03,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:03,873 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:03,874 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:03,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2055213893, now seen corresponding path program 86 times [2018-10-15 13:14:03,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:07,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:07,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:14:07,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:14:07,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:14:07,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:14:07,476 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2018-10-15 13:14:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:18,428 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-15 13:14:18,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:14:18,429 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2018-10-15 13:14:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:18,430 INFO L225 Difference]: With dead ends: 186 [2018-10-15 13:14:18,430 INFO L226 Difference]: Without dead ends: 186 [2018-10-15 13:14:18,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:14:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-15 13:14:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-15 13:14:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 13:14:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-15 13:14:18,433 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-10-15 13:14:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:18,433 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-15 13:14:18,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:14:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-15 13:14:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:14:18,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:18,434 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:18,434 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:18,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1216918393, now seen corresponding path program 87 times [2018-10-15 13:14:18,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:22,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:22,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 13:14:22,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 13:14:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 13:14:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:14:22,384 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 90 states. [2018-10-15 13:14:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:33,677 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 13:14:33,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:14:33,677 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2018-10-15 13:14:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:33,679 INFO L225 Difference]: With dead ends: 188 [2018-10-15 13:14:33,679 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 13:14:33,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:14:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 13:14:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-10-15 13:14:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 13:14:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 13:14:33,683 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-10-15 13:14:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:33,684 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 13:14:33,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 13:14:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 13:14:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 13:14:33,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:33,685 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:33,685 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:33,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1819984567, now seen corresponding path program 88 times [2018-10-15 13:14:33,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:37,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:37,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:14:37,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:14:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:14:37,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:14:37,736 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states.