java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/jm2006_variant.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:16:45,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:16:45,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:16:45,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:16:45,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:16:45,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:16:45,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:16:45,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:16:45,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:16:45,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:16:45,135 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:16:45,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:16:45,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:16:45,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:16:45,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:16:45,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:16:45,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:16:45,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:16:45,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:16:45,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:16:45,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:16:45,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:16:45,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:16:45,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:16:45,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:16:45,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:16:45,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:16:45,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:16:45,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:16:45,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:16:45,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:16:45,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:16:45,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:16:45,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:16:45,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:16:45,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:16:45,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:16:45,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:16:45,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:16:45,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:16:45,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:16:45,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:16:45,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:16:45,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:16:45,208 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:16:45,208 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:16:45,209 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jm2006_variant.c.i_3.bpl [2019-08-05 10:16:45,209 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jm2006_variant.c.i_3.bpl' [2019-08-05 10:16:45,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:16:45,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:16:45,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:45,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:16:45,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:16:45,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:45,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:16:45,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:16:45,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:16:45,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/1) ... [2019-08-05 10:16:45,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:16:45,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:16:45,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:16:45,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:16:45,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (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 [2019-08-05 10:16:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:16:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:16:45,603 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:16:45,603 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:16:45,605 INFO L202 PluginConnector]: Adding new model jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:45 BoogieIcfgContainer [2019-08-05 10:16:45,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:16:45,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:16:45,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:16:45,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:16:45,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:45" (1/2) ... [2019-08-05 10:16:45,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742673c3 and model type jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:16:45, skipping insertion in model container [2019-08-05 10:16:45,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:45" (2/2) ... [2019-08-05 10:16:45,613 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006_variant.c.i_3.bpl [2019-08-05 10:16:45,623 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:16:45,630 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:16:45,646 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:16:45,672 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:16:45,672 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:16:45,673 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:16:45,673 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:16:45,673 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:16:45,673 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:16:45,674 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:16:45,674 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:16:45,674 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:16:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:16:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:16:45,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:45,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:16:45,700 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:45,708 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:16:45,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:45,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:16:45,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:45,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:45,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:45,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:45,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:45,997 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:16:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,031 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:16:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:46,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:16:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,043 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:16:46,044 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:16:46,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:16:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:16:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:16:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:16:46,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:16:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,079 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:16:46,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:16:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:16:46,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:16:46,081 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:16:46,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:46,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:46,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:16:46,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:46,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:46,264 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:16:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,301 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:16:46,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:46,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:16:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,303 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:16:46,303 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:16:46,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:16:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:16:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:16:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:16:46,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:16:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,306 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:16:46,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:16:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:16:46,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,309 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:16:46,309 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,310 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:16:46,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,362 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:46,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:46,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:46,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:16:46,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:16:46,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:46,553 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:16:46,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,648 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:16:46,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:46,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:16:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,650 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:16:46,650 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:16:46,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:16:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:16:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:16:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:16:46,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:16:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,654 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:16:46,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:16:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:16:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:16:46,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,655 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:16:46,655 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,656 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:16:46,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,679 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:47,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:16:47,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:16:47,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:16:47,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:47,063 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:16:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,166 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:16:47,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:16:47,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:16:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,167 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:16:47,167 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:16:47,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:16:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:16:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:16:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:16:47,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:16:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,171 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:16:47,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:16:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:16:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:16:47,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,171 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:16:47,172 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:16:47,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:47,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:47,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:16:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:16:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:47,505 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:16:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,562 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:16:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:16:47,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:16:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,569 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:16:47,569 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:16:47,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:16:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:16:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:16:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:16:47,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:16:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,573 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:16:47,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:16:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:16:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:16:47,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,573 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:16:47,574 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,574 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:16:47,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:47,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:16:47,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:16:47,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:16:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:16:47,786 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:16:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,025 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:16:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:16:48,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:16:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,027 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:16:48,027 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:16:48,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:16:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:16:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:16:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:16:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:16:48,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:16:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,030 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:16:48,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:16:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:16:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:16:48,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,031 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:16:48,031 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:16:48,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:48,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:16:48,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:16:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:16:48,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:48,471 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:16:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,579 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:16:48,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:16:48,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:16:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,581 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:16:48,581 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:16:48,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:16:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:16:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:16:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:16:48,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:16:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,585 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:16:48,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:16:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:16:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:16:48,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,586 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:16:48,586 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:16:48,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,612 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:48,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:16:48,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:16:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:16:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:16:48,837 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:16:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,938 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:16:48,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:16:48,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:16:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,939 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:16:48,939 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:16:48,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:16:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:16:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:16:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:16:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:16:48,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:16:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,944 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:16:48,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:16:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:16:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:16:48,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,945 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:16:48,945 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:16:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:49,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:49,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:16:49,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:16:49,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:16:49,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:16:49,238 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:16:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:49,397 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:16:49,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:16:49,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:16:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:49,398 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:16:49,398 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:16:49,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:16:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:16:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:16:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:16:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:16:49,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:16:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:49,403 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:16:49,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:16:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:16:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:16:49,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:49,404 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:16:49,404 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:16:49,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:49,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:16:49,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:49,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:49,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:16:49,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:16:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:16:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:16:49,763 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:16:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:49,915 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:16:49,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:16:49,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:16:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:49,916 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:16:49,917 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:16:49,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:16:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:16:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:16:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:16:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:16:49,920 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:16:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:49,921 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:16:49,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:16:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:16:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:16:49,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:49,922 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:16:49,922 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:49,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:49,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:16:49,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:49,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:16:49,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:50,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:50,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:16:50,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:16:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:16:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:16:50,162 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:16:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:50,479 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:16:50,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:16:50,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:16:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:50,483 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:16:50,483 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:16:50,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:16:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:16:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:16:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:16:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:16:50,486 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:16:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:50,487 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:16:50,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:16:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:16:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:16:50,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:50,487 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:16:50,488 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:50,488 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:16:50,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:50,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:16:50,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:51,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:51,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:16:51,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:16:51,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:16:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:16:51,013 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:16:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:51,249 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:16:51,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:16:51,250 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:16:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:51,250 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:16:51,250 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:16:51,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:16:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:16:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:16:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:16:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:16:51,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:16:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:51,254 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:16:51,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:16:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:16:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:16:51,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:51,255 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:16:51,255 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:51,255 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:16:51,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:51,278 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:16:51,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:51,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:51,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:16:51,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:16:51,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:16:51,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:16:51,742 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:16:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:51,933 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:16:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:16:51,938 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:16:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:51,939 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:16:51,939 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:16:51,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:16:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:16:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:16:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:16:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:16:51,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:16:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:51,945 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:16:51,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:16:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:16:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:16:51,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:51,946 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:16:51,947 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:16:51,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:51,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:16:51,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:52,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:52,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:16:52,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:16:52,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:16:52,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:16:52,359 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:16:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:52,667 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:16:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:16:52,667 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:16:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:52,668 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:16:52,669 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:16:52,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:16:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:16:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:16:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:16:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:16:52,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:16:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:52,673 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:16:52,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:16:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:16:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:16:52,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:52,673 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:16:52,674 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:16:52,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:52,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:16:52,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:53,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:53,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:16:53,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:16:53,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:16:53,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:16:53,286 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:16:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:53,542 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:16:53,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:16:53,542 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:16:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:53,543 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:16:53,543 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:16:53,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:16:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:16:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:16:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:16:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:16:53,547 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:16:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:53,548 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:16:53,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:16:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:16:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:16:53,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:53,549 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:16:53,549 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:16:53,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:53,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:16:53,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:53,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:53,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:16:53,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:16:53,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:16:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:16:53,946 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:16:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:54,231 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:16:54,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:16:54,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:16:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:54,232 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:16:54,232 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:16:54,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:16:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:16:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:16:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:16:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:16:54,237 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:16:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:54,237 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:16:54,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:16:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:16:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:16:54,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:54,238 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:16:54,238 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:16:54,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:54,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:16:54,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:54,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:54,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:16:54,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:16:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:16:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:16:54,596 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:16:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:54,866 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:16:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:16:54,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:16:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:54,869 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:16:54,869 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:16:54,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:16:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:16:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:16:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:16:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:16:54,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:16:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:54,872 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:16:54,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:16:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:16:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:16:54,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:54,873 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:16:54,874 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:16:54,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:54,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:16:54,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:55,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:55,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:16:55,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:16:55,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:16:55,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:16:55,431 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:16:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:55,890 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:16:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:16:55,891 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:16:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:55,891 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:16:55,892 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:16:55,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:16:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:16:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:16:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:16:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:16:55,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:16:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:55,896 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:16:55,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:16:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:16:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:16:55,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:55,897 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:16:55,897 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:55,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:16:55,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:55,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:16:55,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:56,206 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:16:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:57,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:57,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:16:57,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:16:57,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:16:57,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:16:57,302 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:16:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:57,693 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:16:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:16:57,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:16:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:57,695 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:16:57,695 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:16:57,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:16:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:16:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:16:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:16:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:16:57,700 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:16:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:57,700 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:16:57,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:16:57,701 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:16:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:16:57,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:57,701 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:16:57,702 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:57,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:16:57,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:57,722 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:16:57,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:58,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:58,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:16:58,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:16:58,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:16:58,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:16:58,199 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:16:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:58,680 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:16:58,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:16:58,681 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:16:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:58,681 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:16:58,682 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:16:58,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:16:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:16:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:16:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:16:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:16:58,686 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:16:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:58,687 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:16:58,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:16:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:16:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:16:58,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:58,688 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:16:58,688 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:16:58,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:58,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:16:58,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:59,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:59,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:16:59,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:16:59,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:16:59,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:16:59,308 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:16:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:59,726 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:16:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:16:59,727 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:16:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:59,728 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:16:59,728 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:16:59,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:16:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:16:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:16:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:16:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:16:59,731 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:16:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:59,732 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:16:59,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:16:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:16:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:16:59,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:59,733 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:16:59,733 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:16:59,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:59,754 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:16:59,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:00,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:00,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:17:00,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:17:00,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:17:00,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:00,735 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:17:01,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:01,310 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:17:01,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:17:01,313 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:17:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:01,313 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:17:01,313 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:17:01,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:17:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:17:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:17:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:17:01,317 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:17:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:01,318 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:17:01,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:17:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:17:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:17:01,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:01,319 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:17:01,319 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:17:01,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:01,338 WARN L254 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:17:01,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:02,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:02,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:17:02,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:17:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:17:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:17:02,921 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:17:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:03,699 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:17:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:17:03,701 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:17:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:03,701 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:17:03,701 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:17:03,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:17:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:17:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:17:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:17:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:17:03,705 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:17:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:03,705 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:17:03,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:17:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:17:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:17:03,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:03,706 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:17:03,706 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:03,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:17:03,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:03,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:17:03,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:04,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:04,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:17:04,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:17:04,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:17:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:04,233 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:17:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:04,917 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:17:04,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:17:04,917 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:17:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:04,918 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:17:04,918 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:17:04,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:17:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:17:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:17:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:17:04,922 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:17:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:04,923 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:17:04,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:17:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:17:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:17:04,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:04,923 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:17:04,924 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:17:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:04,944 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:17:04,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:05,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:05,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:17:05,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:17:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:17:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:17:05,584 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:17:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:06,275 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:17:06,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:17:06,276 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:17:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:06,277 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:17:06,277 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:17:06,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:17:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:17:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:17:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:17:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:17:06,282 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:17:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:06,282 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:17:06,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:17:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:17:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:17:06,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:06,283 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:17:06,283 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:17:06,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:06,308 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:17:06,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:06,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:06,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:17:06,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:17:06,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:17:06,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:06,916 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:17:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:07,544 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:17:07,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:17:07,545 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:17:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:07,545 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:17:07,545 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:17:07,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:17:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:17:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:17:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:17:07,549 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:17:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:07,549 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:17:07,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:17:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:17:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:17:07,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:07,550 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:17:07,551 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:07,551 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:17:07,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:07,573 WARN L254 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:17:07,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:08,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:08,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:17:08,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:17:08,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:17:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:08,404 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:17:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:09,033 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:17:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:17:09,034 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:17:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:09,034 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:17:09,035 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:17:09,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:17:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:17:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:17:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:17:09,039 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:17:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:09,039 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:17:09,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:17:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:17:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:17:09,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:09,040 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:17:09,040 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:09,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:17:09,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:09,063 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-05 10:17:09,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:09,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:09,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:17:09,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:17:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:17:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:09,747 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:17:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:10,435 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:17:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:17:10,435 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:17:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:10,436 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:17:10,436 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:17:10,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:17:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:17:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:17:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:17:10,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:17:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:10,441 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:17:10,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:17:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:17:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:17:10,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:10,441 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:17:10,442 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:10,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:17:10,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:10,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:17:10,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:11,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:11,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:17:11,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:17:11,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:17:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:11,431 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:17:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:12,155 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:17:12,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:17:12,155 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:17:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:12,156 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:17:12,156 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:17:12,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:17:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:17:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:17:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:17:12,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:17:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:12,161 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:17:12,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:17:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:17:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:17:12,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:12,162 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:17:12,162 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:12,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:12,162 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:17:12,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:12,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 188 conjunts are in the unsatisfiable core [2019-08-05 10:17:12,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:12,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:12,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:17:12,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:17:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:17:12,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:12,940 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:17:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:13,755 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:17:13,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:17:13,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:17:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:13,757 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:17:13,757 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:17:13,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:17:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:17:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:17:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:17:13,761 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:17:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:13,761 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:17:13,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:17:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:17:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:17:13,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:13,762 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:17:13,763 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:17:13,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:13,785 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 10:17:13,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:14,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:14,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:17:14,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:17:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:17:14,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:14,569 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:17:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:15,387 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:17:15,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:17:15,388 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:17:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:15,388 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:17:15,389 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:17:15,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:17:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:17:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:17:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:17:15,392 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:17:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:15,392 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:17:15,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:17:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:17:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:17:15,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:15,393 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:17:15,393 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:17:15,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:15,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 200 conjunts are in the unsatisfiable core [2019-08-05 10:17:15,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:16,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:16,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:17:16,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:17:16,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:17:16,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:16,523 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:17:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:17,393 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:17:17,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:17:17,393 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:17:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:17,394 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:17:17,394 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:17:17,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:17:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:17:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:17:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:17:17,398 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:17:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:17,399 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:17:17,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:17:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:17:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:17:17,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:17,399 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:17:17,400 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:17:17,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:17,427 WARN L254 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-05 10:17:17,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:18,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:18,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:17:18,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:17:18,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:17:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:17:18,361 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:17:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:19,324 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:17:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:17:19,324 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:17:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:19,325 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:17:19,325 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:17:19,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:17:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:17:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:17:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:17:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:17:19,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:17:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:19,330 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:17:19,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:17:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:17:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:17:19,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:19,330 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:17:19,331 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:17:19,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:19,361 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 212 conjunts are in the unsatisfiable core [2019-08-05 10:17:19,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:20,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:20,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:17:20,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:17:20,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:17:20,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:17:20,362 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:17:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:21,459 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:17:21,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:17:21,459 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:17:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:21,459 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:17:21,459 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:17:21,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:17:21,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:17:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:17:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:17:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:17:21,462 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:17:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:21,462 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:17:21,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:17:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:17:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:17:21,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:21,463 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:17:21,463 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:17:21,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:21,493 WARN L254 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 218 conjunts are in the unsatisfiable core [2019-08-05 10:17:21,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:22,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:22,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:17:22,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:17:22,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:17:22,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:17:22,460 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:17:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:23,496 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:17:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:17:23,497 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:17:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:23,497 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:17:23,498 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:17:23,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:17:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:17:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:17:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:17:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:17:23,501 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:17:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:23,501 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:17:23,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:17:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:17:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:17:23,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:23,502 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:17:23,502 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:23,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:17:23,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:23,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 224 conjunts are in the unsatisfiable core [2019-08-05 10:17:23,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:24,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:24,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:17:24,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:17:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:17:24,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:17:24,564 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:17:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:25,658 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:17:25,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:17:25,659 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:17:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:25,660 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:17:25,660 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:17:25,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:17:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:17:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:17:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:17:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:17:25,663 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:17:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:25,663 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:17:25,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:17:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:17:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:17:25,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:25,664 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:17:25,664 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:17:25,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:25,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 230 conjunts are in the unsatisfiable core [2019-08-05 10:17:25,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:26,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:26,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:17:26,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:17:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:17:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:17:26,999 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:17:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:28,218 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:17:28,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:17:28,219 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:17:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:28,219 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:17:28,220 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:17:28,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:17:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:17:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:17:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:17:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:17:28,223 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:17:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:28,223 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:17:28,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:17:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:17:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:17:28,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:28,224 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:17:28,224 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:28,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:17:28,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:28,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 236 conjunts are in the unsatisfiable core [2019-08-05 10:17:28,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:29,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:29,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:17:29,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:17:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:17:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:17:29,293 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:17:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:30,509 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:17:30,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:17:30,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:17:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:30,510 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:17:30,510 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:17:30,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:17:30,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:17:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:17:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:17:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:17:30,513 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:17:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:30,514 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:17:30,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:17:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:17:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:17:30,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:30,514 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:17:30,515 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:30,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:17:30,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:30,550 WARN L254 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-05 10:17:30,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:31,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:31,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:17:31,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:17:31,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:17:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:17:31,875 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:17:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:33,193 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:17:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:17:33,193 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:17:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:33,194 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:17:33,194 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:17:33,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:17:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:17:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:17:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:17:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:17:33,198 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:17:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:33,198 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:17:33,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:17:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:17:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:17:33,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:33,199 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:17:33,200 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:33,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:17:33,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:33,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 248 conjunts are in the unsatisfiable core [2019-08-05 10:17:33,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:34,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:34,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:17:34,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:17:34,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:17:34,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:17:34,537 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:17:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,927 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:17:35,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:17:35,928 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:17:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,929 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:17:35,929 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:17:35,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:17:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:17:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:17:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:17:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:17:35,932 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:17:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,933 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:17:35,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:17:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:17:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:17:35,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,933 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:17:35,934 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:17:35,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 254 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:37,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:37,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:17:37,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:17:37,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:17:37,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:17:37,255 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:17:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:38,698 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:17:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:17:38,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:17:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:38,699 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:17:38,699 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:17:38,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:17:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:17:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:17:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:17:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:17:38,702 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:17:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:38,702 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:17:38,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:17:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:17:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:17:38,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:38,703 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:17:38,703 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:17:38,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:38,741 WARN L254 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 260 conjunts are in the unsatisfiable core [2019-08-05 10:17:38,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:39,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:39,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:17:39,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:17:39,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:17:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:17:39,960 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:17:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:41,519 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:17:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:17:41,519 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:17:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:41,520 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:17:41,520 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:17:41,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:17:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:17:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:17:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:17:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:17:41,523 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:17:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:41,523 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:17:41,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:17:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:17:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:17:41,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:41,524 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:17:41,524 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:17:41,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:41,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 266 conjunts are in the unsatisfiable core [2019-08-05 10:17:41,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:41,994 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:17:42,197 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:17:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:43,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:43,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:17:43,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:17:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:17:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:17:43,564 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:17:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:45,120 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:17:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:17:45,121 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:17:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:45,121 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:17:45,121 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:17:45,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:17:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:17:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:17:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:17:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:17:45,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:17:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:45,125 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:17:45,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:17:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:17:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:17:45,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:45,126 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:17:45,126 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:17:45,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:45,168 WARN L254 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 272 conjunts are in the unsatisfiable core [2019-08-05 10:17:45,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:46,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:46,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:17:46,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:17:46,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:17:46,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:17:46,518 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:17:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:48,312 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:17:48,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:17:48,313 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:17:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:48,313 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:17:48,314 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:17:48,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:17:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:17:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:17:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:17:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:17:48,317 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:17:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:48,317 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:17:48,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:17:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:17:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:17:48,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:48,318 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:17:48,319 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:17:48,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:48,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 278 conjunts are in the unsatisfiable core [2019-08-05 10:17:48,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:49,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:49,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:17:49,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:17:49,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:17:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:17:49,776 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:17:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:51,501 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:17:51,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:17:51,502 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:17:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:51,503 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:17:51,503 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:17:51,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:17:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:17:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:17:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:17:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:17:51,506 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:17:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:51,506 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:17:51,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:17:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:17:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:17:51,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:51,507 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:17:51,507 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:51,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:51,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:17:51,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:51,551 WARN L254 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 284 conjunts are in the unsatisfiable core [2019-08-05 10:17:51,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:53,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:53,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:17:53,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:17:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:17:53,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:17:53,720 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:17:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:55,486 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:17:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:17:55,487 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:17:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:55,488 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:17:55,488 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:17:55,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:17:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:17:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:17:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:17:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:17:55,490 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:17:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:55,491 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:17:55,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:17:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:17:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:17:55,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:55,491 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:17:55,491 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:55,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:17:55,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:55,550 WARN L254 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 290 conjunts are in the unsatisfiable core [2019-08-05 10:17:55,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:57,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:57,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:17:57,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:17:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:17:57,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:17:57,838 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:17:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:59,740 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:17:59,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:17:59,741 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:17:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:59,742 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:17:59,742 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:17:59,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:17:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:17:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:17:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:17:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:17:59,744 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:17:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:59,744 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:17:59,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:17:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:17:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:17:59,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:59,745 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:17:59,745 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:59,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:17:59,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:59,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 296 conjunts are in the unsatisfiable core [2019-08-05 10:17:59,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:01,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:01,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:18:01,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:18:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:18:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:18:01,368 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:18:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:03,423 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:18:03,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:18:03,423 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:18:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:03,424 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:18:03,424 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:18:03,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:18:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:18:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:18:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:18:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:18:03,427 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:18:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:03,427 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:18:03,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:18:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:18:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:18:03,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:03,428 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:18:03,429 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:03,429 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:18:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:03,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 302 conjunts are in the unsatisfiable core [2019-08-05 10:18:03,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:05,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:05,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:18:05,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:18:05,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:18:05,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:18:05,065 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:18:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:07,160 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:18:07,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:18:07,160 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:18:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:07,161 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:18:07,161 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:18:07,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:18:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:18:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:18:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:18:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:18:07,164 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:18:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:07,164 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:18:07,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:18:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:18:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:18:07,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:07,165 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:18:07,165 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:18:07,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:07,216 WARN L254 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 308 conjunts are in the unsatisfiable core [2019-08-05 10:18:07,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:09,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:09,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:18:09,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:18:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:18:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:18:09,056 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:18:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:11,209 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:18:11,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:18:11,210 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:18:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:11,210 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:18:11,210 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:18:11,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:18:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:18:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:18:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:18:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:18:11,214 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:18:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:11,214 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:18:11,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:18:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:18:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:18:11,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:11,215 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:18:11,215 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:11,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:11,215 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:18:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:11,250 WARN L254 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 314 conjunts are in the unsatisfiable core [2019-08-05 10:18:11,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:13,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:13,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:18:13,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:18:13,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:18:13,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:18:13,332 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:18:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:15,598 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:18:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:18:15,599 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:18:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:15,600 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:18:15,600 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:18:15,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:18:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:18:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:18:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:18:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:18:15,603 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:18:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:15,603 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:18:15,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:18:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:18:15,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:18:15,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:15,604 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:18:15,604 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:18:15,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:15,660 WARN L254 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 320 conjunts are in the unsatisfiable core [2019-08-05 10:18:15,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:17,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:17,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:18:17,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:18:17,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:18:17,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:18:17,478 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:18:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:19,878 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:18:19,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:18:19,879 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:18:19,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:19,880 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:18:19,880 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:18:19,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:18:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:18:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:18:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:18:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:18:19,883 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:18:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:19,883 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:18:19,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:18:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:18:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:18:19,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,884 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:18:19,884 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:18:19,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 326 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:21,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:21,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:18:21,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:18:21,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:18:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:18:21,758 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:18:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:24,383 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:18:24,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:18:24,384 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:18:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:24,385 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:18:24,385 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:18:24,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:18:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:18:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:18:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:18:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:18:24,388 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:18:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:24,388 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:18:24,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:18:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:18:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:18:24,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:24,389 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:18:24,389 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:24,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:18:24,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,449 WARN L254 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 332 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:26,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:26,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:18:26,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:18:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:18:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:18:26,496 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:18:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:29,155 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:18:29,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:18:29,156 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:18:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:29,157 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:18:29,157 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:18:29,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:18:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:18:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:18:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:18:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:18:29,160 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:18:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:29,160 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:18:29,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:18:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:18:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:18:29,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:29,161 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:18:29,161 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:29,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:18:29,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:29,205 WARN L254 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 338 conjunts are in the unsatisfiable core [2019-08-05 10:18:29,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:31,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:31,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:18:31,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:18:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:18:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:18:31,146 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:18:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:33,887 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:18:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:18:33,887 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:18:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:33,888 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:18:33,888 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:18:33,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:18:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:18:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:18:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:18:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:18:33,891 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:18:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:33,891 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:18:33,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:18:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:18:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:18:33,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:33,892 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:18:33,892 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:18:33,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:33,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 344 conjunts are in the unsatisfiable core [2019-08-05 10:18:33,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:35,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:35,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:18:35,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:18:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:18:35,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:18:35,967 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:18:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:38,815 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:18:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:18:38,815 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:18:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:38,816 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:18:38,816 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:18:38,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:18:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:18:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:18:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:18:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:18:38,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:18:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:38,820 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:18:38,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:18:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:18:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:18:38,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:38,820 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:18:38,821 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:38,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:18:38,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:38,874 WARN L254 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 350 conjunts are in the unsatisfiable core [2019-08-05 10:18:38,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:40,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:40,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:18:40,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:18:40,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:18:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:18:40,992 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:18:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:43,867 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:18:43,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:18:43,868 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:18:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:43,869 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:18:43,869 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:18:43,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:18:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:18:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:18:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:18:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:18:43,872 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:18:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:43,872 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:18:43,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:18:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:18:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:18:43,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:43,873 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:18:43,873 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:18:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:43,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 356 conjunts are in the unsatisfiable core [2019-08-05 10:18:43,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:46,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:46,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:18:46,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:18:46,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:18:46,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:18:46,212 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:18:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:49,210 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:18:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:18:49,211 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:18:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:49,212 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:18:49,212 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:18:49,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:18:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:18:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:18:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:18:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:18:49,215 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:18:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:49,216 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:18:49,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:18:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:18:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:18:49,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:49,217 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:18:49,217 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:49,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:18:49,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:49,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 362 conjunts are in the unsatisfiable core [2019-08-05 10:18:49,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:51,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:51,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:18:51,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:18:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:18:51,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:18:51,503 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:18:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:54,574 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:18:54,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:18:54,574 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:18:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:54,575 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:18:54,575 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:18:54,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:18:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:18:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:18:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:18:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:18:54,578 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:18:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:54,578 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:18:54,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:18:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:18:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:18:54,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:54,579 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:18:54,579 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:18:54,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:54,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 368 conjunts are in the unsatisfiable core [2019-08-05 10:18:54,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:57,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:18:57,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:18:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:18:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:18:57,693 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:19:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:00,888 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:19:00,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:19:00,889 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:19:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:00,890 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:19:00,890 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:19:00,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:19:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:19:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:19:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:19:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:19:00,893 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:19:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:00,893 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:19:00,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:19:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:19:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:19:00,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:00,894 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:19:00,894 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:00,894 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:19:00,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:00,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 374 conjunts are in the unsatisfiable core [2019-08-05 10:19:00,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:01,997 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:19:02,266 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:19:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:04,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:04,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:19:04,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:19:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:19:04,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:19:04,825 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:19:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:08,016 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:19:08,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:19:08,017 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:19:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:08,017 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:19:08,018 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:19:08,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:19:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:19:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:19:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:19:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:19:08,020 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:19:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:08,020 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:19:08,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:19:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:19:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:19:08,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:08,021 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:19:08,021 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:19:08,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:08,083 WARN L254 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 380 conjunts are in the unsatisfiable core [2019-08-05 10:19:08,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:10,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:10,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:19:10,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:19:10,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:19:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:19:10,631 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:19:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:13,936 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:19:13,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:19:13,936 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:19:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:13,937 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:19:13,937 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:19:13,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:19:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:19:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:19:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:19:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:19:13,938 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:19:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:13,939 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:19:13,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:19:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:19:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:19:13,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:13,939 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:19:13,939 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:13,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:19:13,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:14,000 WARN L254 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 386 conjunts are in the unsatisfiable core [2019-08-05 10:19:14,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:16,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:16,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:19:16,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:19:16,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:19:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:19:16,660 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:19:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:20,067 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:19:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:19:20,068 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:19:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:20,069 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:19:20,069 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:19:20,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:19:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:19:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:19:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:19:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:19:20,071 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:19:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:20,071 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:19:20,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:19:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:19:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:19:20,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:20,072 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:19:20,072 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:19:20,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:20,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 392 conjunts are in the unsatisfiable core [2019-08-05 10:19:20,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:22,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:22,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:19:22,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:19:22,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:19:22,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:19:22,816 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:19:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:26,452 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:19:26,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:19:26,453 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:19:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:26,454 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:19:26,454 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:19:26,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:19:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:19:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:19:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:19:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:19:26,457 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:19:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:26,457 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:19:26,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:19:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:19:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:19:26,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:26,458 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:19:26,458 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:19:26,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:26,526 WARN L254 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 398 conjunts are in the unsatisfiable core [2019-08-05 10:19:26,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:29,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:29,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:19:29,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:19:29,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:19:29,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:19:29,275 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:19:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:32,941 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:19:32,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:19:32,941 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:19:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:32,942 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:19:32,942 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:19:32,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:19:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:19:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:19:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:19:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:19:32,945 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:19:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:32,946 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:19:32,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:19:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:19:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:19:32,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:32,946 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:19:32,947 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:19:32,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:33,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 404 conjunts are in the unsatisfiable core [2019-08-05 10:19:33,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:36,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:36,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:19:36,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:19:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:19:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:19:36,016 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:19:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:39,780 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:19:39,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:19:39,780 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:19:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:39,781 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:19:39,781 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:19:39,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:19:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:19:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:19:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:19:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:19:39,784 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:19:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:39,784 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:19:39,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:19:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:19:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:19:39,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:39,785 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:19:39,785 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:39,785 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:19:39,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:39,850 WARN L254 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 410 conjunts are in the unsatisfiable core [2019-08-05 10:19:39,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:42,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:42,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:19:42,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:19:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:19:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:19:42,949 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:19:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:46,864 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:19:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:19:46,864 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:19:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:46,865 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:19:46,865 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:19:46,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:19:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:19:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:19:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:19:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:19:46,868 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:19:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:46,868 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:19:46,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:19:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:19:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:19:46,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:46,870 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:19:46,870 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:19:46,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:46,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 416 conjunts are in the unsatisfiable core [2019-08-05 10:19:46,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:49,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:49,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:19:49,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:19:49,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:19:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:19:49,970 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:19:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:53,959 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:19:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:19:53,959 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:19:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:53,960 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:19:53,960 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:19:53,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:19:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:19:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:19:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:19:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:19:53,964 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:19:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:53,964 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:19:53,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:19:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:19:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:19:53,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:53,965 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:19:53,965 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:53,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:19:53,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:54,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 422 conjunts are in the unsatisfiable core [2019-08-05 10:19:54,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:57,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:57,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:19:57,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:19:57,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:19:57,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:19:57,222 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:20:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:01,391 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:20:01,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:20:01,392 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:20:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:01,392 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:20:01,393 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:20:01,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:20:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:20:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:20:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:20:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:20:01,396 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:20:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:01,396 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:20:01,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:20:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:20:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:20:01,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:01,397 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:20:01,398 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:20:01,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:01,480 WARN L254 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 428 conjunts are in the unsatisfiable core [2019-08-05 10:20:01,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:04,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:04,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:20:04,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:20:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:20:04,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:20:04,512 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:20:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:08,760 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:20:08,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:20:08,760 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:20:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:08,761 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:20:08,761 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:20:08,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:20:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:20:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:20:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:20:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:20:08,765 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:20:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:08,765 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:20:08,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:20:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:20:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:20:08,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:08,766 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:20:08,766 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:08,767 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:20:08,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:08,910 WARN L254 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 434 conjunts are in the unsatisfiable core [2019-08-05 10:20:08,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:12,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:12,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:20:12,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:20:12,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:20:12,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:20:12,353 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:20:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:16,696 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:20:16,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:20:16,697 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:20:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:16,698 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:20:16,698 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:20:16,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:20:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:20:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:20:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:20:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:20:16,701 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:20:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:16,701 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:20:16,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:20:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:20:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:20:16,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:16,702 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:20:16,703 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:16,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:20:16,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:16,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 440 conjunts are in the unsatisfiable core [2019-08-05 10:20:16,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:17,099 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:20:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:20,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:20,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:20:20,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:20:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:20:20,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:20:20,339 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:20:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:24,841 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:20:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:20:24,842 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:20:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:24,843 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:20:24,843 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:20:24,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:20:24,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:20:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:20:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:20:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:20:24,846 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:20:24,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:24,846 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:20:24,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:20:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:20:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:20:24,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:24,847 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:20:24,847 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:20:24,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:24,965 WARN L254 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 446 conjunts are in the unsatisfiable core [2019-08-05 10:20:24,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:28,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:28,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:20:28,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:20:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:20:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:20:28,576 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:20:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:33,174 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:20:33,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:20:33,174 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:20:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:33,175 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:20:33,176 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:20:33,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:20:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:20:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:20:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:20:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:20:33,184 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:20:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:33,184 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:20:33,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:20:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:20:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:20:33,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:33,185 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:20:33,185 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:20:33,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:33,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 452 conjunts are in the unsatisfiable core [2019-08-05 10:20:33,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:36,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:36,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:20:36,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:20:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:20:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:20:36,869 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:20:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:41,618 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:20:41,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:20:41,619 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:20:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:41,619 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:20:41,620 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:20:41,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:20:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:20:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:20:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:20:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:20:41,622 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:20:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:41,622 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:20:41,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:20:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:20:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:20:41,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:41,623 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:20:41,623 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:20:41,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:41,714 WARN L254 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 458 conjunts are in the unsatisfiable core [2019-08-05 10:20:41,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:45,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:20:45,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:20:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:20:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:20:45,150 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:20:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:49,990 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:20:49,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:20:49,991 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:20:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:49,991 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:20:49,991 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:20:49,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:20:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:20:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:20:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:20:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:20:49,994 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:20:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:49,994 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:20:49,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:20:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:20:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:20:49,995 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:49,995 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:20:49,996 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:20:49,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:50,086 WARN L254 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 464 conjunts are in the unsatisfiable core [2019-08-05 10:20:50,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:53,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:53,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:20:53,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:20:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:20:53,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:20:53,698 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:20:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:58,720 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:20:58,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:20:58,720 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:20:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:58,721 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:20:58,721 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:20:58,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:20:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:20:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:20:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:20:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:20:58,724 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:20:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:58,724 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:20:58,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:20:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:20:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:20:58,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:58,726 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:20:58,726 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:58,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:20:58,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:58,818 WARN L254 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 470 conjunts are in the unsatisfiable core [2019-08-05 10:20:58,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:20:59,282 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:20:59,283 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:20:59,288 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:20:59,288 INFO L202 PluginConnector]: Adding new model jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:20:59 BoogieIcfgContainer [2019-08-05 10:20:59,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:20:59,290 INFO L168 Benchmark]: Toolchain (without parser) took 254041.13 ms. Allocated memory was 141.0 MB in the beginning and 231.7 MB in the end (delta: 90.7 MB). Free memory was 109.5 MB in the beginning and 14.1 MB in the end (delta: 95.4 MB). Peak memory consumption was 186.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:59,291 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:20:59,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.17 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:59,292 INFO L168 Benchmark]: Boogie Preprocessor took 24.82 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:59,292 INFO L168 Benchmark]: RCFGBuilder took 294.32 ms. Allocated memory is still 141.0 MB. Free memory was 106.5 MB in the beginning and 96.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:59,293 INFO L168 Benchmark]: TraceAbstraction took 253682.01 ms. Allocated memory was 141.0 MB in the beginning and 231.7 MB in the end (delta: 90.7 MB). Free memory was 96.3 MB in the beginning and 14.1 MB in the end (delta: 82.2 MB). Peak memory consumption was 172.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:59,296 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.17 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.82 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 294.32 ms. Allocated memory is still 141.0 MB. Free memory was 106.5 MB in the beginning and 96.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253682.01 ms. Allocated memory was 141.0 MB in the beginning and 231.7 MB in the end (delta: 90.7 MB). Free memory was 96.3 MB in the beginning and 14.1 MB in the end (delta: 82.2 MB). Peak memory consumption was 172.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 76,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 253.6s OverallTime, 77 OverallIterations, 76 TraceHistogramMax, 133.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 0 SDslu, 2926 SDs, 0 SdLazy, 155078 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3002 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2926 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 76 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 116.4s InterpolantComputationTime, 3078 NumberOfCodeBlocks, 3078 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 3002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2121152 SizeOfPredicates, 532 NumberOfNonLiveVariables, 22230 ConjunctsInSsa, 18164 ConjunctsInUnsatCore, 76 InterpolantComputations, 1 PerfectInterpolantSequences, 0/73150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown