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/recursive/addition-correct.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:08:00,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:08:00,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:08:00,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:08:00,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:08:00,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:08:00,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:08:00,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:08:00,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:08:00,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:08:00,321 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:08:00,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:08:00,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:08:00,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:08:00,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:08:00,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:08:00,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:08:00,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:08:00,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:08:00,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:08:00,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:08:00,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:08:00,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:08:00,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:08:00,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:08:00,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:08:00,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:08:00,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:08:00,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:08:00,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:08:00,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:08:00,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:08:00,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:08:00,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:08:00,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:08:00,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:08:00,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:08:00,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:08:00,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:08:00,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:08:00,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:08:00,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:08:00,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:08:00,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:08:00,442 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:08:00,442 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:08:00,443 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/addition-correct.bpl [2019-08-05 11:08:00,443 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/addition-correct.bpl' [2019-08-05 11:08:00,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:08:00,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:08:00,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:00,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:08:00,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:08:00,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,510 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:08:00,510 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:08:00,510 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:08:00,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:00,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:08:00,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:08:00,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:08:00,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:08:00,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:08:00,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:08:00,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:08:00,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (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 11:08:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 11:08:00,604 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 11:08:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2019-08-05 11:08:00,604 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2019-08-05 11:08:00,682 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 11:08:00,830 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 11:08:00,906 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:08:00,907 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:08:00,908 INFO L202 PluginConnector]: Adding new model addition-correct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:00 BoogieIcfgContainer [2019-08-05 11:08:00,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:08:00,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:08:00,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:08:00,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:08:00,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/2) ... [2019-08-05 11:08:00,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9264a0 and model type addition-correct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:08:00, skipping insertion in model container [2019-08-05 11:08:00,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "addition-correct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:00" (2/2) ... [2019-08-05 11:08:00,916 INFO L109 eAbstractionObserver]: Analyzing ICFG addition-correct.bpl [2019-08-05 11:08:00,926 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:08:00,932 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-08-05 11:08:00,948 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-08-05 11:08:00,970 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:08:00,971 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:08:00,971 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:08:00,971 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:08:00,971 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:08:00,972 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:08:00,972 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:08:00,972 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:08:00,972 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:08:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-08-05 11:08:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:08:00,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:00,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:08:01,001 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-08-05 11:08:01,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,113 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 11:08:01,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:01,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:01,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:01,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:01,134 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-08-05 11:08:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,180 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:08:01,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:01,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:08:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,194 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:08:01,195 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:08:01,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:08:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:08:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:08:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 11:08:01,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 2 [2019-08-05 11:08:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,237 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 11:08:01,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 11:08:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:08:01,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:08:01,239 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,240 INFO L82 PathProgramCache]: Analyzing trace with hash 964, now seen corresponding path program 1 times [2019-08-05 11:08:01,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,265 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 11:08:01,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:01,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:01,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:01,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:01,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:01,269 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-08-05 11:08:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,273 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:08:01,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:01,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:08:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,275 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:08:01,275 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:08:01,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:08:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:08:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:08:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:08:01,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 2 [2019-08-05 11:08:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,282 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:08:01,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:08:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:08:01,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:08:01,284 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2019-08-05 11:08:01,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,341 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 11:08:01,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:01,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:01,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:01,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:01,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:01,344 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 3 states. [2019-08-05 11:08:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,443 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:08:01,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:01,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:08:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,446 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:08:01,446 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:08:01,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:08:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:08:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:08:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 11:08:01,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 3 [2019-08-05 11:08:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,451 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 11:08:01,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 11:08:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:08:01,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:08:01,455 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,457 INFO L82 PathProgramCache]: Analyzing trace with hash 35912, now seen corresponding path program 1 times [2019-08-05 11:08:01,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,462 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,556 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 11:08:01,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:01,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:01,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:08:01,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:08:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:08:01,558 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 4 states. [2019-08-05 11:08:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,627 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 11:08:01,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:08:01,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:08:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,631 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:08:01,631 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:08:01,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:08:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:08:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2019-08-05 11:08:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:08:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:08:01,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 3 [2019-08-05 11:08:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,638 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:08:01,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:08:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:08:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:08:01,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:01,640 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2059636210, now seen corresponding path program 1 times [2019-08-05 11:08:01,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,770 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 11:08:01,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:01,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:08:01,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:08:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:08:01,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:08:01,774 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 11:08:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,880 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:08:01,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:08:01,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:08:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,882 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:08:01,882 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:08:01,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:08:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:08:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:08:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:08:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:08:01,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 7 [2019-08-05 11:08:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,892 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:08:01,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:08:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:08:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:08:01,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,894 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:01,894 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash -306285440, now seen corresponding path program 1 times [2019-08-05 11:08:01,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:08:02,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:02,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:08:02,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:08:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:08:02,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:08:02,166 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-05 11:08:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:02,231 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:08:02,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:08:02,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 11:08:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:02,233 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:08:02,233 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:08:02,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:08:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:08:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:08:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:08:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:08:02,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2019-08-05 11:08:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:02,238 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:08:02,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:08:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:08:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:08:02,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:02,239 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:08:02,240 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1978871610, now seen corresponding path program 2 times [2019-08-05 11:08:02,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:02,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:08:02,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:08:02,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:02,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:08:02,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:08:02,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:08:02,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:08:02,425 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 11:08:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:02,587 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 11:08:02,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:08:02,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-08-05 11:08:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:02,589 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:08:02,589 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:08:02,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:08:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:08:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:08:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:08:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:08:02,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 17 [2019-08-05 11:08:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:02,595 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:08:02,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:08:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:08:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:08:02,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:02,597 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-08-05 11:08:02,597 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1075173816, now seen corresponding path program 3 times [2019-08-05 11:08:02,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:02,619 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:08:02,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:08:02,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:02,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:08:02,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:08:02,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:08:02,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:02,816 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-08-05 11:08:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:03,138 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 11:08:03,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:08:03,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-08-05 11:08:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:03,140 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:08:03,141 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:08:03,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:08:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:08:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:08:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:08:03,146 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 22 [2019-08-05 11:08:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:03,146 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:08:03,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:08:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:08:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:08:03,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:03,148 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-08-05 11:08:03,148 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1616067714, now seen corresponding path program 4 times [2019-08-05 11:08:03,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 11:08:03,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:08:03,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:08:03,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:08:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:03,384 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-08-05 11:08:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:03,507 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 11:08:03,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:08:03,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 11:08:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:03,509 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:08:03,509 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:08:03,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:08:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:08:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:08:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 11:08:03,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 27 [2019-08-05 11:08:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:03,517 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 11:08:03,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:08:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 11:08:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:08:03,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:03,519 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 11:08:03,519 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:03,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash -196594960, now seen corresponding path program 5 times [2019-08-05 11:08:03,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 11:08:03,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:08:03,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:08:03,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:08:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:03,805 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-08-05 11:08:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:04,051 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:08:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:04,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-08-05 11:08:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:04,053 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:08:04,054 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:08:04,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:08:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:08:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:08:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 11:08:04,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 32 [2019-08-05 11:08:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:04,060 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 11:08:04,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 11:08:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:08:04,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:04,061 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 11:08:04,062 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:04,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1160361418, now seen corresponding path program 6 times [2019-08-05 11:08:04,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:04,090 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:08:04,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-08-05 11:08:04,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:04,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:08:04,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:08:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:08:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:04,342 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-08-05 11:08:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:04,474 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-08-05 11:08:04,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:08:04,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-08-05 11:08:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:04,476 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:08:04,476 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:08:04,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:08:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:08:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:08:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 11:08:04,482 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 37 [2019-08-05 11:08:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:04,483 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 11:08:04,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:08:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 11:08:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:08:04,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:04,484 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 11:08:04,485 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1281916888, now seen corresponding path program 7 times [2019-08-05 11:08:04,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:04,512 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:08:04,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 7 proven. 56 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-08-05 11:08:04,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:04,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:08:04,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:08:04,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:08:04,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:08:04,735 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-08-05 11:08:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:04,921 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 11:08:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:08:04,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-08-05 11:08:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:04,924 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:08:04,924 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:08:04,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:08:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:08:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:08:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:08:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 11:08:04,931 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 42 [2019-08-05 11:08:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:04,931 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 11:08:04,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:08:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 11:08:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:08:04,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:04,933 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-08-05 11:08:04,934 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:04,934 INFO L82 PathProgramCache]: Analyzing trace with hash -431790866, now seen corresponding path program 8 times [2019-08-05 11:08:04,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:04,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:08:04,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 72 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 11:08:05,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:05,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:08:05,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:08:05,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:08:05,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:08:05,189 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-08-05 11:08:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:05,703 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 11:08:05,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:08:05,704 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-08-05 11:08:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:05,705 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:08:05,705 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:08:05,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:08:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:08:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:08:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:08:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 11:08:05,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 47 [2019-08-05 11:08:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:05,712 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 11:08:05,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:08:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 11:08:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:08:05,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:05,714 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-08-05 11:08:05,715 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1824145056, now seen corresponding path program 9 times [2019-08-05 11:08:05,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:05,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:08:05,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 9 proven. 90 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-08-05 11:08:06,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:08:06,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:08:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:08:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:08:06,198 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-08-05 11:08:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:06,434 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-08-05 11:08:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:08:06,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-08-05 11:08:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:06,436 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:08:06,436 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:08:06,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:08:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:08:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:08:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:08:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 11:08:06,442 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 52 [2019-08-05 11:08:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:06,442 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 11:08:06,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:08:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 11:08:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:08:06,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:06,444 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-08-05 11:08:06,444 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2102520922, now seen corresponding path program 10 times [2019-08-05 11:08:06,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:06,472 WARN L254 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:08:06,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 10 proven. 110 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:08:06,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:06,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:08:06,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:08:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:08:06,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:08:06,824 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-08-05 11:08:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:07,056 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-05 11:08:07,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:08:07,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-08-05 11:08:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:07,058 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:08:07,058 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:08:07,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:08:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:08:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:08:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:08:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 11:08:07,064 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 57 [2019-08-05 11:08:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:07,064 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 11:08:07,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:08:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 11:08:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:08:07,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:07,066 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-08-05 11:08:07,066 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash -728435048, now seen corresponding path program 11 times [2019-08-05 11:08:07,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:07,104 WARN L254 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:08:07,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 11 proven. 132 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-08-05 11:08:07,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:07,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:08:07,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:08:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:08:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:08:07,428 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-08-05 11:08:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:07,648 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 11:08:07,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:08:07,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2019-08-05 11:08:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:07,649 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:08:07,649 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:08:07,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:08:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:08:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:08:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:08:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 11:08:07,657 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 62 [2019-08-05 11:08:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:07,658 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 11:08:07,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:08:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 11:08:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:08:07,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:07,659 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-08-05 11:08:07,660 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:07,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2033166754, now seen corresponding path program 12 times [2019-08-05 11:08:07,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:07,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:08:07,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 12 proven. 156 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-05 11:08:08,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:08,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:08:08,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:08:08,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:08:08,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:08:08,864 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-08-05 11:08:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:09,163 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-08-05 11:08:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:08:09,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-08-05 11:08:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,165 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:08:09,165 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:08:09,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:08:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:08:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:08:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:08:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 11:08:09,171 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 67 [2019-08-05 11:08:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,171 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 11:08:09,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:08:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 11:08:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:08:09,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,173 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-08-05 11:08:09,173 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:09,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1530454064, now seen corresponding path program 13 times [2019-08-05 11:08:09,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 13 proven. 182 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-08-05 11:08:09,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:09,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:08:09,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:08:09,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:08:09,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:08:09,828 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-08-05 11:08:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:10,114 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 11:08:10,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:08:10,114 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-08-05 11:08:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:10,116 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:08:10,116 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:08:10,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:08:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:08:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:08:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:08:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 11:08:10,124 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 72 [2019-08-05 11:08:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:10,125 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 11:08:10,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:08:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 11:08:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:08:10,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:10,126 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-08-05 11:08:10,127 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1083953898, now seen corresponding path program 14 times [2019-08-05 11:08:10,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:10,148 WARN L254 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:08:10,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 14 proven. 210 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-08-05 11:08:10,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:10,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:08:10,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:08:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:08:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:08:10,531 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-08-05 11:08:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:10,883 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-05 11:08:10,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:08:10,883 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2019-08-05 11:08:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:10,885 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:08:10,885 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:08:10,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:08:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:08:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:08:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:08:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 11:08:10,892 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 77 [2019-08-05 11:08:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:10,893 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 11:08:10,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:08:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 11:08:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:08:10,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:10,894 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-08-05 11:08:10,894 INFO L418 AbstractCegarLoop]: === Iteration 20 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash -585220856, now seen corresponding path program 15 times [2019-08-05 11:08:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:10,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:08:10,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 15 proven. 240 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-08-05 11:08:11,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:11,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:08:11,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:08:11,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:08:11,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:08:11,305 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-08-05 11:08:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:11,727 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-08-05 11:08:11,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:08:11,731 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-08-05 11:08:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:11,732 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:08:11,732 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:08:11,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:08:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:08:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:08:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:08:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 11:08:11,738 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 82 [2019-08-05 11:08:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:11,739 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 11:08:11,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:08:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 11:08:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:08:11,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:11,740 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-08-05 11:08:11,741 INFO L418 AbstractCegarLoop]: === Iteration 21 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:11,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash 253990862, now seen corresponding path program 16 times [2019-08-05 11:08:11,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:11,763 WARN L254 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:08:11,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 16 proven. 272 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-08-05 11:08:12,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:12,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:08:12,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:08:12,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:08:12,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:08:12,349 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-08-05 11:08:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:12,798 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-05 11:08:12,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:08:12,798 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-08-05 11:08:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:12,799 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:08:12,799 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:08:12,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:08:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:08:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:08:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:08:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 11:08:12,805 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 87 [2019-08-05 11:08:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:12,806 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 11:08:12,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:08:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 11:08:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:08:12,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:12,807 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-08-05 11:08:12,808 INFO L418 AbstractCegarLoop]: === Iteration 22 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1025749440, now seen corresponding path program 17 times [2019-08-05 11:08:12,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:12,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:08:12,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 17 proven. 306 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-08-05 11:08:13,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:13,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:08:13,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:08:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:08:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:08:13,301 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-08-05 11:08:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:13,912 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-05 11:08:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:08:13,914 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2019-08-05 11:08:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:13,916 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:08:13,916 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:08:13,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:08:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:08:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:08:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:08:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 11:08:13,921 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 92 [2019-08-05 11:08:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:13,922 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 11:08:13,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:08:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 11:08:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:08:13,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:13,923 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-08-05 11:08:13,924 INFO L418 AbstractCegarLoop]: === Iteration 23 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:13,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1362585978, now seen corresponding path program 18 times [2019-08-05 11:08:13,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:13,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 11:08:13,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 18 proven. 342 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-08-05 11:08:14,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:14,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:08:14,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:08:14,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:08:14,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:08:14,518 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-08-05 11:08:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:14,876 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-08-05 11:08:14,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:08:14,876 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2019-08-05 11:08:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:14,877 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:08:14,877 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:08:14,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:08:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:08:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:08:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:08:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 11:08:14,883 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 97 [2019-08-05 11:08:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:14,883 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 11:08:14,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:08:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 11:08:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:08:14,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:14,885 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-08-05 11:08:14,885 INFO L418 AbstractCegarLoop]: === Iteration 24 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash -951889032, now seen corresponding path program 19 times [2019-08-05 11:08:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:14,909 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 11:08:14,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 19 proven. 380 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-08-05 11:08:15,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:15,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:08:15,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:08:15,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:08:15,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:08:15,344 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-08-05 11:08:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:15,741 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-05 11:08:15,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:08:15,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2019-08-05 11:08:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:15,742 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:08:15,742 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:08:15,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:08:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:08:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:08:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:08:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 11:08:15,748 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 102 [2019-08-05 11:08:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:15,749 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 11:08:15,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:08:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 11:08:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:08:15,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:15,750 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-08-05 11:08:15,751 INFO L418 AbstractCegarLoop]: === Iteration 25 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:15,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1829579070, now seen corresponding path program 20 times [2019-08-05 11:08:15,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:15,776 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 11:08:15,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 20 proven. 420 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-08-05 11:08:16,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:16,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:08:16,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:08:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:08:16,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:08:16,482 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-08-05 11:08:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:16,994 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-05 11:08:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:08:16,994 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 107 [2019-08-05 11:08:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:16,996 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:08:16,996 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:08:16,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:08:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:08:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:08:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:08:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 11:08:17,001 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 107 [2019-08-05 11:08:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:17,002 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 11:08:17,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:08:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 11:08:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:08:17,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:17,003 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-08-05 11:08:17,003 INFO L418 AbstractCegarLoop]: === Iteration 26 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1200966832, now seen corresponding path program 21 times [2019-08-05 11:08:17,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:17,029 WARN L254 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 11:08:17,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 21 proven. 462 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-08-05 11:08:17,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:17,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:08:17,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:08:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:08:17,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:08:17,829 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-08-05 11:08:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:18,499 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-08-05 11:08:18,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:08:18,500 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 112 [2019-08-05 11:08:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:18,501 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:08:18,501 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:08:18,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:08:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:08:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:08:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:08:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 11:08:18,507 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 112 [2019-08-05 11:08:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:18,507 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 11:08:18,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:08:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 11:08:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:08:18,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:18,509 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-08-05 11:08:18,509 INFO L418 AbstractCegarLoop]: === Iteration 27 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash -290762762, now seen corresponding path program 22 times [2019-08-05 11:08:18,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:18,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 11:08:18,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 22 proven. 506 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-08-05 11:08:19,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:19,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:08:19,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:08:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:08:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:08:19,569 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-08-05 11:08:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:20,226 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-08-05 11:08:20,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:08:20,227 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 117 [2019-08-05 11:08:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:20,228 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:08:20,229 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:08:20,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:08:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:08:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:08:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:08:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 11:08:20,234 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 117 [2019-08-05 11:08:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:20,235 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 11:08:20,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:08:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 11:08:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 11:08:20,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:20,236 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-08-05 11:08:20,237 INFO L418 AbstractCegarLoop]: === Iteration 28 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:20,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1293171176, now seen corresponding path program 23 times [2019-08-05 11:08:20,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:20,265 WARN L254 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 11:08:20,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 23 proven. 552 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-08-05 11:08:21,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:21,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:08:21,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:08:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:08:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:08:21,625 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-08-05 11:08:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:22,137 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 11:08:22,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:08:22,140 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 122 [2019-08-05 11:08:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:22,141 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:08:22,141 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:08:22,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:08:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:08:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:08:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:08:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 11:08:22,146 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 122 [2019-08-05 11:08:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:22,147 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 11:08:22,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:08:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 11:08:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:08:22,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:22,148 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-08-05 11:08:22,148 INFO L418 AbstractCegarLoop]: === Iteration 29 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash -295892306, now seen corresponding path program 24 times [2019-08-05 11:08:22,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:22,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 11:08:22,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 24 proven. 600 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2019-08-05 11:08:23,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:23,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:08:23,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:08:23,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:08:23,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:08:23,871 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-08-05 11:08:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:24,602 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-08-05 11:08:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:08:24,602 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 127 [2019-08-05 11:08:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:24,604 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:08:24,604 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:08:24,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:08:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:08:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:08:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:08:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 11:08:24,609 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 127 [2019-08-05 11:08:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:24,610 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 11:08:24,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:08:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 11:08:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 11:08:24,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:24,611 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-08-05 11:08:24,612 INFO L418 AbstractCegarLoop]: === Iteration 30 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1291983648, now seen corresponding path program 25 times [2019-08-05 11:08:24,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:24,640 WARN L254 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 11:08:24,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 25 proven. 650 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-08-05 11:08:25,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:25,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:08:25,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:08:25,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:08:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:08:25,292 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-08-05 11:08:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:25,873 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-08-05 11:08:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:08:25,874 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 132 [2019-08-05 11:08:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:25,875 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:08:25,875 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:08:25,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:08:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:08:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:08:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:08:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 11:08:25,880 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 132 [2019-08-05 11:08:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:25,881 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 11:08:25,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:08:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 11:08:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:08:25,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:25,882 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-08-05 11:08:25,883 INFO L418 AbstractCegarLoop]: === Iteration 31 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2094815590, now seen corresponding path program 26 times [2019-08-05 11:08:25,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:25,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 11:08:25,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 26 proven. 702 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2019-08-05 11:08:26,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:26,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:08:26,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:08:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:08:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:08:26,739 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-08-05 11:08:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:27,303 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-05 11:08:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:08:27,304 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 137 [2019-08-05 11:08:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:27,305 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:08:27,305 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:08:27,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:08:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:08:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:08:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:08:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 11:08:27,311 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 137 [2019-08-05 11:08:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:27,311 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 11:08:27,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:08:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 11:08:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 11:08:27,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:27,312 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-08-05 11:08:27,312 INFO L418 AbstractCegarLoop]: === Iteration 32 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:27,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash -392105896, now seen corresponding path program 27 times [2019-08-05 11:08:27,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:27,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 11:08:27,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 27 proven. 756 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2019-08-05 11:08:28,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:28,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:08:28,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:08:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:08:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:08:28,080 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-08-05 11:08:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:28,707 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-08-05 11:08:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:08:28,707 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 142 [2019-08-05 11:08:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:28,708 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:08:28,708 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:08:28,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:08:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:08:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:08:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:08:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 11:08:28,713 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 142 [2019-08-05 11:08:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:28,713 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 11:08:28,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:08:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 11:08:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:08:28,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:28,715 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-08-05 11:08:28,715 INFO L418 AbstractCegarLoop]: === Iteration 33 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633886, now seen corresponding path program 28 times [2019-08-05 11:08:28,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:28,747 WARN L254 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 11:08:28,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 28 proven. 812 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2019-08-05 11:08:29,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:29,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:08:29,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:08:29,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:08:29,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:08:29,712 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-08-05 11:08:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:30,386 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-05 11:08:30,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:08:30,386 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 147 [2019-08-05 11:08:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:30,388 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:08:30,388 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:08:30,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:08:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:08:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:08:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:08:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 11:08:30,393 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 147 [2019-08-05 11:08:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:30,393 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 11:08:30,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:08:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 11:08:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 11:08:30,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:30,395 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-08-05 11:08:30,395 INFO L418 AbstractCegarLoop]: === Iteration 34 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1389184624, now seen corresponding path program 29 times [2019-08-05 11:08:30,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:30,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 11:08:30,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 29 proven. 870 refuted. 0 times theorem prover too weak. 1247 trivial. 0 not checked. [2019-08-05 11:08:31,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:31,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:08:31,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:08:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:08:31,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:08:31,306 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-08-05 11:08:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:31,989 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-08-05 11:08:31,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:08:31,989 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 152 [2019-08-05 11:08:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:31,990 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:08:31,991 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:08:31,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:08:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:08:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:08:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:08:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 11:08:31,995 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 152 [2019-08-05 11:08:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:31,996 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 11:08:31,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:08:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 11:08:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:08:31,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:31,997 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-08-05 11:08:31,997 INFO L418 AbstractCegarLoop]: === Iteration 35 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1221872938, now seen corresponding path program 30 times [2019-08-05 11:08:31,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:32,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-05 11:08:32,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 30 proven. 930 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2019-08-05 11:08:33,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:33,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:08:33,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:08:33,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:08:33,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:08:33,155 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-08-05 11:08:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:33,855 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-08-05 11:08:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:08:33,855 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 157 [2019-08-05 11:08:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:33,856 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:08:33,856 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:08:33,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:08:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:08:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:08:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:08:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-05 11:08:33,861 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 157 [2019-08-05 11:08:33,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:33,862 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-05 11:08:33,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:08:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-05 11:08:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 11:08:33,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:33,863 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-08-05 11:08:33,863 INFO L418 AbstractCegarLoop]: === Iteration 36 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash -738625848, now seen corresponding path program 31 times [2019-08-05 11:08:33,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:33,901 WARN L254 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 11:08:33,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 31 proven. 992 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2019-08-05 11:08:35,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:35,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:08:35,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:08:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:08:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:08:35,061 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-08-05 11:08:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:35,801 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-08-05 11:08:35,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:08:35,802 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 162 [2019-08-05 11:08:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:35,803 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:08:35,803 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:08:35,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:08:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:08:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:08:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:08:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 11:08:35,808 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 162 [2019-08-05 11:08:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:35,808 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 11:08:35,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:08:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 11:08:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:08:35,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:35,810 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-08-05 11:08:35,810 INFO L418 AbstractCegarLoop]: === Iteration 37 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1919925646, now seen corresponding path program 32 times [2019-08-05 11:08:35,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:35,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-05 11:08:35,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:36,209 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:08:36,395 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:08:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 32 proven. 1056 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-08-05 11:08:37,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:08:37,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:08:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:08:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:08:37,685 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-08-05 11:08:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:38,555 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-08-05 11:08:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:08:38,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 167 [2019-08-05 11:08:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:38,556 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:08:38,556 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:08:38,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:08:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:08:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:08:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:08:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 11:08:38,561 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 167 [2019-08-05 11:08:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:38,561 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 11:08:38,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:08:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 11:08:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 11:08:38,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:38,563 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-08-05 11:08:38,563 INFO L418 AbstractCegarLoop]: === Iteration 38 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash 37169152, now seen corresponding path program 33 times [2019-08-05 11:08:38,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:38,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 11:08:38,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 33 proven. 1122 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-08-05 11:08:39,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:39,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:08:39,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:08:39,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:08:39,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:08:39,735 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-08-05 11:08:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:40,672 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-08-05 11:08:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:08:40,672 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 172 [2019-08-05 11:08:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:40,674 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:08:40,674 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:08:40,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:08:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:08:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:08:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:08:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-05 11:08:40,679 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 172 [2019-08-05 11:08:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:40,680 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-05 11:08:40,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:08:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-05 11:08:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:08:40,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:40,681 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-08-05 11:08:40,682 INFO L418 AbstractCegarLoop]: === Iteration 39 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:40,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1533631558, now seen corresponding path program 34 times [2019-08-05 11:08:40,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:40,722 WARN L254 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-05 11:08:40,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 34 proven. 1190 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2019-08-05 11:08:42,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:42,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:08:42,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:08:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:08:42,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:08:42,116 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-08-05 11:08:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:43,060 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-08-05 11:08:43,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:08:43,061 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 177 [2019-08-05 11:08:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:43,062 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:08:43,062 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:08:43,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:08:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:08:43,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:08:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:08:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 11:08:43,068 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 177 [2019-08-05 11:08:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:43,068 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 11:08:43,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:08:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 11:08:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-08-05 11:08:43,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:43,069 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-08-05 11:08:43,070 INFO L418 AbstractCegarLoop]: === Iteration 40 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash 153996600, now seen corresponding path program 35 times [2019-08-05 11:08:43,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:43,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 11:08:43,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 35 proven. 1260 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2019-08-05 11:08:44,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:44,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:08:44,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:08:44,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:08:44,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:08:44,454 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-08-05 11:08:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:45,693 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-05 11:08:45,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:08:45,693 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 182 [2019-08-05 11:08:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:45,695 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:08:45,695 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:08:45,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:08:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:08:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:08:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:08:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 11:08:45,700 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 182 [2019-08-05 11:08:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:45,701 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 11:08:45,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:08:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 11:08:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:08:45,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:45,702 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-08-05 11:08:45,702 INFO L418 AbstractCegarLoop]: === Iteration 41 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash -254636290, now seen corresponding path program 36 times [2019-08-05 11:08:45,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:45,741 WARN L254 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 227 conjunts are in the unsatisfiable core [2019-08-05 11:08:45,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 36 proven. 1332 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2019-08-05 11:08:46,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:46,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:08:46,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:08:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:08:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:08:46,741 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-08-05 11:08:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:47,790 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-08-05 11:08:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:08:47,796 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 187 [2019-08-05 11:08:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:47,797 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:08:47,797 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:08:47,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:08:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:08:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:08:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:08:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-05 11:08:47,802 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 187 [2019-08-05 11:08:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:47,802 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-05 11:08:47,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:08:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-05 11:08:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-05 11:08:47,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:47,804 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-08-05 11:08:47,804 INFO L418 AbstractCegarLoop]: === Iteration 42 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1507891600, now seen corresponding path program 37 times [2019-08-05 11:08:47,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:47,853 WARN L254 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 11:08:47,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 37 proven. 1406 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2019-08-05 11:08:49,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:49,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:08:49,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:08:49,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:08:49,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:08:49,052 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-08-05 11:08:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:50,376 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-08-05 11:08:50,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:08:50,376 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 192 [2019-08-05 11:08:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:50,377 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:08:50,377 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:08:50,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:08:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:08:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:08:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:08:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 11:08:50,382 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 192 [2019-08-05 11:08:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:50,382 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 11:08:50,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:08:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 11:08:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 11:08:50,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:50,384 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-08-05 11:08:50,384 INFO L418 AbstractCegarLoop]: === Iteration 43 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2023402058, now seen corresponding path program 38 times [2019-08-05 11:08:50,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:50,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 239 conjunts are in the unsatisfiable core [2019-08-05 11:08:50,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 38 proven. 1482 refuted. 0 times theorem prover too weak. 2147 trivial. 0 not checked. [2019-08-05 11:08:51,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:51,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:08:51,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:08:51,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:08:51,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:08:51,525 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-08-05 11:08:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:52,650 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-05 11:08:52,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:08:52,650 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 197 [2019-08-05 11:08:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:52,651 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:08:52,652 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:08:52,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:08:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:08:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:08:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:08:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 11:08:52,657 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 197 [2019-08-05 11:08:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:52,658 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 11:08:52,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:08:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 11:08:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-05 11:08:52,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:52,659 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1] [2019-08-05 11:08:52,660 INFO L418 AbstractCegarLoop]: === Iteration 44 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1112404904, now seen corresponding path program 39 times [2019-08-05 11:08:52,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:52,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 11:08:52,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 39 proven. 1560 refuted. 0 times theorem prover too weak. 2262 trivial. 0 not checked. [2019-08-05 11:08:54,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:54,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:08:54,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:08:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:08:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:08:54,316 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-08-05 11:08:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:55,696 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-08-05 11:08:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:08:55,696 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 202 [2019-08-05 11:08:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:55,698 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:08:55,698 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:08:55,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:08:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:08:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:08:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:08:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-05 11:08:55,704 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 202 [2019-08-05 11:08:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:55,704 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-05 11:08:55,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:08:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-05 11:08:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:08:55,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:55,706 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1] [2019-08-05 11:08:55,706 INFO L418 AbstractCegarLoop]: === Iteration 45 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:55,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1982091154, now seen corresponding path program 40 times [2019-08-05 11:08:55,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:55,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 251 conjunts are in the unsatisfiable core [2019-08-05 11:08:55,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 40 proven. 1640 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-08-05 11:08:56,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:56,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:08:56,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:08:56,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:08:56,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:08:56,982 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-08-05 11:08:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:58,194 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-08-05 11:08:58,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:08:58,194 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 207 [2019-08-05 11:08:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:58,196 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:08:58,196 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:08:58,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:08:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:08:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:08:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:08:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 11:08:58,201 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 207 [2019-08-05 11:08:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:58,201 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 11:08:58,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:08:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 11:08:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-08-05 11:08:58,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:58,203 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1] [2019-08-05 11:08:58,203 INFO L418 AbstractCegarLoop]: === Iteration 46 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1292143392, now seen corresponding path program 41 times [2019-08-05 11:08:58,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:58,247 WARN L254 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 11:08:58,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 41 proven. 1722 refuted. 0 times theorem prover too weak. 2501 trivial. 0 not checked. [2019-08-05 11:08:59,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:59,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:08:59,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:08:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:08:59,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:08:59,601 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-08-05 11:09:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:01,256 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-08-05 11:09:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:09:01,256 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 212 [2019-08-05 11:09:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:01,258 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:09:01,258 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:01,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:09:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:09:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:09:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 11:09:01,263 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 212 [2019-08-05 11:09:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:01,264 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 11:09:01,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:09:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 11:09:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 11:09:01,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:01,265 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1] [2019-08-05 11:09:01,266 INFO L418 AbstractCegarLoop]: === Iteration 47 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1192255706, now seen corresponding path program 42 times [2019-08-05 11:09:01,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:01,319 WARN L254 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 263 conjunts are in the unsatisfiable core [2019-08-05 11:09:01,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 42 proven. 1806 refuted. 0 times theorem prover too weak. 2625 trivial. 0 not checked. [2019-08-05 11:09:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:02,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:09:02,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:09:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:09:02,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:02,743 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-08-05 11:09:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:04,120 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-08-05 11:09:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:09:04,120 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 217 [2019-08-05 11:09:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:04,122 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:09:04,122 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:09:04,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:09:04,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:09:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:09:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-05 11:09:04,126 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 217 [2019-08-05 11:09:04,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:04,127 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-05 11:09:04,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:09:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-05 11:09:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-08-05 11:09:04,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:04,128 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1] [2019-08-05 11:09:04,129 INFO L418 AbstractCegarLoop]: === Iteration 48 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -110499304, now seen corresponding path program 43 times [2019-08-05 11:09:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:04,212 WARN L254 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 11:09:04,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 43 proven. 1892 refuted. 0 times theorem prover too weak. 2752 trivial. 0 not checked. [2019-08-05 11:09:05,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:05,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:09:05,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:09:05,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:09:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:09:05,819 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-08-05 11:09:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:07,215 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-05 11:09:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:09:07,216 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 222 [2019-08-05 11:09:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:07,217 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:09:07,218 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:07,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:09:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:09:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:09:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 11:09:07,222 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 222 [2019-08-05 11:09:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:07,223 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 11:09:07,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:09:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 11:09:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-08-05 11:09:07,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:07,225 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1] [2019-08-05 11:09:07,225 INFO L418 AbstractCegarLoop]: === Iteration 49 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1801134558, now seen corresponding path program 44 times [2019-08-05 11:09:07,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:07,286 WARN L254 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 275 conjunts are in the unsatisfiable core [2019-08-05 11:09:07,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 44 proven. 1980 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2019-08-05 11:09:08,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:08,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:09:08,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:09:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:09:08,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:09:08,811 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-08-05 11:09:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:10,583 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-08-05 11:09:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:09:10,584 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 227 [2019-08-05 11:09:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:10,585 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:09:10,585 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:09:10,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:09:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:09:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:09:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:09:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 11:09:10,591 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 227 [2019-08-05 11:09:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:10,591 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 11:09:10,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:09:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 11:09:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-05 11:09:10,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:10,593 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1] [2019-08-05 11:09:10,593 INFO L418 AbstractCegarLoop]: === Iteration 50 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:10,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash 47928144, now seen corresponding path program 45 times [2019-08-05 11:09:10,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:10,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 11:09:10,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:11,043 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:09:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 45 proven. 2070 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2019-08-05 11:09:12,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:12,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:09:12,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:09:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:09:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:09:12,542 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-08-05 11:09:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:14,434 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-08-05 11:09:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:09:14,434 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 232 [2019-08-05 11:09:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:14,436 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:09:14,436 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:14,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:09:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:09:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:09:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-05 11:09:14,442 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 232 [2019-08-05 11:09:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:14,442 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-05 11:09:14,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:09:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-05 11:09:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-08-05 11:09:14,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:14,444 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1] [2019-08-05 11:09:14,444 INFO L418 AbstractCegarLoop]: === Iteration 51 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash -841467754, now seen corresponding path program 46 times [2019-08-05 11:09:14,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:14,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 287 conjunts are in the unsatisfiable core [2019-08-05 11:09:14,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 46 proven. 2162 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2019-08-05 11:09:17,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:17,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:09:17,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:09:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:09:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:09:17,371 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-08-05 11:09:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:19,082 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-08-05 11:09:19,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:09:19,083 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 237 [2019-08-05 11:09:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:19,084 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:09:19,084 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:09:19,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:09:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:09:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:09:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:09:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 11:09:19,089 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 237 [2019-08-05 11:09:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:19,090 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 11:09:19,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:09:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 11:09:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-08-05 11:09:19,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:19,091 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1] [2019-08-05 11:09:19,092 INFO L418 AbstractCegarLoop]: === Iteration 52 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1754378376, now seen corresponding path program 47 times [2019-08-05 11:09:19,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:19,164 WARN L254 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 11:09:19,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 47 proven. 2256 refuted. 0 times theorem prover too weak. 3290 trivial. 0 not checked. [2019-08-05 11:09:21,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:21,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:09:21,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:09:21,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:09:21,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:09:21,005 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-08-05 11:09:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:23,535 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-05 11:09:23,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:09:23,536 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 242 [2019-08-05 11:09:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:23,537 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:09:23,538 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:23,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:09:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:09:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:09:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 11:09:23,543 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 242 [2019-08-05 11:09:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:23,543 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 11:09:23,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:09:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 11:09:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-08-05 11:09:23,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:23,545 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1] [2019-08-05 11:09:23,545 INFO L418 AbstractCegarLoop]: === Iteration 53 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash 589357902, now seen corresponding path program 48 times [2019-08-05 11:09:23,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:23,615 WARN L254 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 299 conjunts are in the unsatisfiable core [2019-08-05 11:09:23,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 48 proven. 2352 refuted. 0 times theorem prover too weak. 3432 trivial. 0 not checked. [2019-08-05 11:09:25,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:25,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:09:25,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:09:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:09:25,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2604, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:09:25,204 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-08-05 11:09:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:27,311 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-08-05 11:09:27,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:09:27,311 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 247 [2019-08-05 11:09:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:27,313 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:09:27,313 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:09:27,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=152, Invalid=2604, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:09:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:09:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:09:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:09:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-05 11:09:27,318 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 247 [2019-08-05 11:09:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:27,318 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-05 11:09:27,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:09:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-05 11:09:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-08-05 11:09:27,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:27,320 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1] [2019-08-05 11:09:27,320 INFO L418 AbstractCegarLoop]: === Iteration 54 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash 802095552, now seen corresponding path program 49 times [2019-08-05 11:09:27,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:27,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 11:09:27,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 49 proven. 2450 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2019-08-05 11:09:29,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:29,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:09:29,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:09:29,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:09:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2707, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:09:29,210 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-08-05 11:09:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:31,426 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-08-05 11:09:31,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:09:31,426 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 252 [2019-08-05 11:09:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:31,427 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:09:31,427 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:09:31,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=155, Invalid=2707, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:09:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:09:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:09:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:09:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-05 11:09:31,432 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 252 [2019-08-05 11:09:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:31,432 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-05 11:09:31,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:09:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-05 11:09:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-08-05 11:09:31,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:31,434 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1] [2019-08-05 11:09:31,434 INFO L418 AbstractCegarLoop]: === Iteration 55 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 66003462, now seen corresponding path program 50 times [2019-08-05 11:09:31,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:31,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 311 conjunts are in the unsatisfiable core [2019-08-05 11:09:31,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 50 proven. 2550 refuted. 0 times theorem prover too weak. 3725 trivial. 0 not checked. [2019-08-05 11:09:33,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:33,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:09:33,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:09:33,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:09:33,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2812, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:09:33,338 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-08-05 11:09:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,222 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-05 11:09:35,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:09:35,223 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 257 [2019-08-05 11:09:35,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,224 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:09:35,225 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:09:35,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=158, Invalid=2812, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:09:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:09:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:09:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:09:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-05 11:09:35,230 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 257 [2019-08-05 11:09:35,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,230 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-05 11:09:35,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:09:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-05 11:09:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-08-05 11:09:35,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,232 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1] [2019-08-05 11:09:35,232 INFO L418 AbstractCegarLoop]: === Iteration 56 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1982511368, now seen corresponding path program 51 times [2019-08-05 11:09:35,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,313 WARN L254 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 51 proven. 2652 refuted. 0 times theorem prover too weak. 3876 trivial. 0 not checked. [2019-08-05 11:09:37,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:37,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:09:37,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:09:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:09:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2919, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:09:37,420 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-08-05 11:09:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,497 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2019-08-05 11:09:39,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:09:39,497 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 262 [2019-08-05 11:09:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,499 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:09:39,499 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:09:39,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=161, Invalid=2919, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:09:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:09:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:09:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:09:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-08-05 11:09:39,502 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 262 [2019-08-05 11:09:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,503 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-08-05 11:09:39,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:09:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-08-05 11:09:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 11:09:39,505 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,505 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1] [2019-08-05 11:09:39,505 INFO L418 AbstractCegarLoop]: === Iteration 57 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1627589442, now seen corresponding path program 52 times [2019-08-05 11:09:39,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:39,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 323 conjunts are in the unsatisfiable core [2019-08-05 11:09:39,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 52 proven. 2756 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2019-08-05 11:09:41,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:41,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:09:41,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:09:41,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:09:41,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3028, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:09:41,927 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-08-05 11:09:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:43,953 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2019-08-05 11:09:43,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:09:43,954 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 267 [2019-08-05 11:09:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:43,955 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:09:43,955 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:09:43,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=164, Invalid=3028, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:09:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:09:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:09:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:09:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-05 11:09:43,961 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 267 [2019-08-05 11:09:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:43,961 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-05 11:09:43,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:09:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-05 11:09:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-08-05 11:09:43,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:43,963 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1] [2019-08-05 11:09:43,964 INFO L418 AbstractCegarLoop]: === Iteration 58 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:43,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1813610448, now seen corresponding path program 53 times [2019-08-05 11:09:43,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,047 WARN L254 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 329 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 53 proven. 2862 refuted. 0 times theorem prover too weak. 4187 trivial. 0 not checked. [2019-08-05 11:09:46,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:46,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:09:46,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:09:46,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:09:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3139, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:09:46,014 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-08-05 11:09:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,323 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-08-05 11:09:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:09:48,323 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 272 [2019-08-05 11:09:48,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,325 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:09:48,325 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:48,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=167, Invalid=3139, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:09:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:09:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:09:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-05 11:09:48,330 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 272 [2019-08-05 11:09:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,330 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-05 11:09:48,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:09:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-05 11:09:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-08-05 11:09:48,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,332 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 1, 1, 1, 1, 1] [2019-08-05 11:09:48,332 INFO L418 AbstractCegarLoop]: === Iteration 59 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash -117154954, now seen corresponding path program 54 times [2019-08-05 11:09:48,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,449 WARN L254 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 335 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,636 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 11:09:48,812 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:09:49,475 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:09:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 54 proven. 2970 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-08-05 11:09:51,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:51,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:09:51,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:09:51,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:09:51,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3252, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:09:51,743 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-08-05 11:09:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:54,142 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2019-08-05 11:09:54,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:09:54,142 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 277 [2019-08-05 11:09:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:54,143 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:09:54,144 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:09:54,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=170, Invalid=3252, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:09:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:09:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:09:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:09:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-08-05 11:09:54,149 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 277 [2019-08-05 11:09:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:54,150 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-08-05 11:09:54,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:09:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-08-05 11:09:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-08-05 11:09:54,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:54,152 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 1, 1, 1, 1, 1] [2019-08-05 11:09:54,152 INFO L418 AbstractCegarLoop]: === Iteration 60 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:54,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:54,152 INFO L82 PathProgramCache]: Analyzing trace with hash 390376808, now seen corresponding path program 55 times [2019-08-05 11:09:54,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:54,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 341 conjunts are in the unsatisfiable core [2019-08-05 11:09:54,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 55 proven. 3080 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2019-08-05 11:09:56,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:56,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:09:56,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:09:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:09:56,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3367, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:09:56,168 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-08-05 11:09:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,712 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2019-08-05 11:09:58,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:09:58,712 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 282 [2019-08-05 11:09:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,714 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:09:58,714 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:09:58,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=173, Invalid=3367, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:09:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:09:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 11:09:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:09:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-05 11:09:58,720 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 282 [2019-08-05 11:09:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,720 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-05 11:09:58,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:09:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-05 11:09:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-08-05 11:09:58,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,722 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1] [2019-08-05 11:09:58,722 INFO L418 AbstractCegarLoop]: === Iteration 61 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:09:58,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,723 INFO L82 PathProgramCache]: Analyzing trace with hash 750736942, now seen corresponding path program 56 times [2019-08-05 11:09:58,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 347 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 56 proven. 3192 refuted. 0 times theorem prover too weak. 4676 trivial. 0 not checked. [2019-08-05 11:10:00,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:00,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:10:00,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:10:00,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:10:00,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3484, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:10:00,935 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-08-05 11:10:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,678 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2019-08-05 11:10:03,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:10:03,678 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 287 [2019-08-05 11:10:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,680 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:10:03,680 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:10:03,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=176, Invalid=3484, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:10:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:10:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 11:10:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:10:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-05 11:10:03,685 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 287 [2019-08-05 11:10:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,685 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-05 11:10:03,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:10:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-05 11:10:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-08-05 11:10:03,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,687 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 1, 1, 1, 1, 1] [2019-08-05 11:10:03,688 INFO L418 AbstractCegarLoop]: === Iteration 62 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1228000928, now seen corresponding path program 57 times [2019-08-05 11:10:03,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 353 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 57 proven. 3306 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2019-08-05 11:10:06,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:10:06,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:10:06,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:10:06,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3603, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:10:06,108 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-08-05 11:10:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,811 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2019-08-05 11:10:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:10:08,811 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 292 [2019-08-05 11:10:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,813 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:10:08,813 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:10:08,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=179, Invalid=3603, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:10:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:10:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 11:10:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:10:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-08-05 11:10:08,817 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 292 [2019-08-05 11:10:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,817 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-08-05 11:10:08,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:10:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-08-05 11:10:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-08-05 11:10:08,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,819 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 1, 1, 1, 1, 1] [2019-08-05 11:10:08,819 INFO L418 AbstractCegarLoop]: === Iteration 63 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1427643162, now seen corresponding path program 58 times [2019-08-05 11:10:08,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 359 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,419 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:10:10,365 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:10:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 58 proven. 3422 refuted. 0 times theorem prover too weak. 5017 trivial. 0 not checked. [2019-08-05 11:10:12,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:10:12,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:10:12,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:10:12,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3724, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:10:12,807 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-08-05 11:10:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,473 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-08-05 11:10:15,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:10:15,474 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 297 [2019-08-05 11:10:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,475 INFO L225 Difference]: With dead ends: 128 [2019-08-05 11:10:15,475 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:10:15,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=182, Invalid=3724, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:10:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:10:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 11:10:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:10:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-05 11:10:15,480 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 297 [2019-08-05 11:10:15,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,481 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-05 11:10:15,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:10:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-05 11:10:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-08-05 11:10:15,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,483 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 1, 1, 1, 1, 1] [2019-08-05 11:10:15,483 INFO L418 AbstractCegarLoop]: === Iteration 64 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:15,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1963990056, now seen corresponding path program 59 times [2019-08-05 11:10:15,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 365 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 59 proven. 3540 refuted. 0 times theorem prover too weak. 5192 trivial. 0 not checked. [2019-08-05 11:10:18,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:18,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:10:18,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:10:18,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:10:18,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3847, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:10:18,177 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-08-05 11:10:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,002 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2019-08-05 11:10:21,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:10:21,003 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 302 [2019-08-05 11:10:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,004 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:10:21,005 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:10:21,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=185, Invalid=3847, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:10:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:10:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-05 11:10:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-05 11:10:21,010 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 302 [2019-08-05 11:10:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,010 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-05 11:10:21,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:10:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-05 11:10:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-08-05 11:10:21,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,012 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 1, 1, 1, 1, 1] [2019-08-05 11:10:21,013 INFO L418 AbstractCegarLoop]: === Iteration 65 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2050492318, now seen corresponding path program 60 times [2019-08-05 11:10:21,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 371 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 60 proven. 3660 refuted. 0 times theorem prover too weak. 5370 trivial. 0 not checked. [2019-08-05 11:10:23,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:23,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:10:23,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:10:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:10:23,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3972, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:10:23,726 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-08-05 11:10:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,638 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2019-08-05 11:10:26,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:10:26,638 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 307 [2019-08-05 11:10:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,639 INFO L225 Difference]: With dead ends: 132 [2019-08-05 11:10:26,639 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 11:10:26,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=188, Invalid=3972, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:10:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 11:10:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-05 11:10:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 11:10:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-08-05 11:10:26,644 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 307 [2019-08-05 11:10:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,645 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-08-05 11:10:26,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:10:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-08-05 11:10:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-08-05 11:10:26,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,646 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 1, 1, 1, 1, 1] [2019-08-05 11:10:26,646 INFO L418 AbstractCegarLoop]: === Iteration 66 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash 700509456, now seen corresponding path program 61 times [2019-08-05 11:10:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,723 WARN L254 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 377 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 61 proven. 3782 refuted. 0 times theorem prover too weak. 5551 trivial. 0 not checked. [2019-08-05 11:10:29,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:10:29,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:10:29,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:10:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=4099, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:10:29,378 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-08-05 11:10:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,489 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-08-05 11:10:32,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:10:32,489 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 312 [2019-08-05 11:10:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,491 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:10:32,491 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:10:32,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=191, Invalid=4099, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:10:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:10:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 11:10:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:10:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-05 11:10:32,497 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 312 [2019-08-05 11:10:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,497 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-05 11:10:32,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:10:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-05 11:10:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-08-05 11:10:32,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,500 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 1, 1, 1, 1, 1] [2019-08-05 11:10:32,500 INFO L418 AbstractCegarLoop]: === Iteration 67 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2003418710, now seen corresponding path program 62 times [2019-08-05 11:10:32,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 383 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 62 proven. 3906 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2019-08-05 11:10:35,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:10:35,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:10:35,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:10:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=4228, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:10:35,085 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-08-05 11:10:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,275 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-08-05 11:10:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:10:38,275 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 317 [2019-08-05 11:10:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,276 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:10:38,277 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 11:10:38,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=194, Invalid=4228, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:10:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 11:10:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-05 11:10:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 11:10:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-05 11:10:38,283 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 317 [2019-08-05 11:10:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,283 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-05 11:10:38,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:10:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-05 11:10:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-08-05 11:10:38,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,285 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 1, 1, 1, 1, 1] [2019-08-05 11:10:38,286 INFO L418 AbstractCegarLoop]: === Iteration 68 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,286 INFO L82 PathProgramCache]: Analyzing trace with hash 518449736, now seen corresponding path program 63 times [2019-08-05 11:10:38,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 389 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 63 proven. 4032 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2019-08-05 11:10:40,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:10:40,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:10:40,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:10:40,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=4359, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:10:40,867 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-08-05 11:10:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:44,029 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2019-08-05 11:10:44,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:10:44,029 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 322 [2019-08-05 11:10:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,031 INFO L225 Difference]: With dead ends: 138 [2019-08-05 11:10:44,031 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:44,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=197, Invalid=4359, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:10:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 11:10:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:10:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-08-05 11:10:44,036 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 322 [2019-08-05 11:10:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,036 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-08-05 11:10:44,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:10:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-08-05 11:10:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-08-05 11:10:44,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,038 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 1, 1, 1, 1, 1] [2019-08-05 11:10:44,039 INFO L418 AbstractCegarLoop]: === Iteration 69 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:44,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1791555314, now seen corresponding path program 64 times [2019-08-05 11:10:44,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,177 WARN L254 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 395 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 64 proven. 4160 refuted. 0 times theorem prover too weak. 6112 trivial. 0 not checked. [2019-08-05 11:10:46,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:10:46,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:10:46,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:10:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=4492, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:10:46,958 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-08-05 11:10:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,182 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2019-08-05 11:10:50,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:10:50,182 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 327 [2019-08-05 11:10:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,183 INFO L225 Difference]: With dead ends: 140 [2019-08-05 11:10:50,184 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:10:50,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=200, Invalid=4492, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:10:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:10:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 11:10:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 11:10:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-05 11:10:50,188 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 327 [2019-08-05 11:10:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,189 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-05 11:10:50,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:10:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-05 11:10:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-08-05 11:10:50,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,191 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 1, 1, 1, 1, 1] [2019-08-05 11:10:50,192 INFO L418 AbstractCegarLoop]: === Iteration 70 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:50,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,192 INFO L82 PathProgramCache]: Analyzing trace with hash -811345024, now seen corresponding path program 65 times [2019-08-05 11:10:50,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 401 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 65 proven. 4290 refuted. 0 times theorem prover too weak. 6305 trivial. 0 not checked. [2019-08-05 11:10:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:10:55,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:10:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:10:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=4627, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:10:55,039 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-08-05 11:10:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,332 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-08-05 11:10:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:10:58,333 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 332 [2019-08-05 11:10:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,334 INFO L225 Difference]: With dead ends: 142 [2019-08-05 11:10:58,334 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:10:58,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=203, Invalid=4627, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:10:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:10:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 11:10:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:10:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-05 11:10:58,339 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 332 [2019-08-05 11:10:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,340 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-05 11:10:58,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:10:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-05 11:10:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-08-05 11:10:58,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,342 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 1, 1, 1, 1, 1] [2019-08-05 11:10:58,342 INFO L418 AbstractCegarLoop]: === Iteration 71 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:10:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash 475654086, now seen corresponding path program 66 times [2019-08-05 11:10:58,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,438 WARN L254 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 407 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 66 proven. 4422 refuted. 0 times theorem prover too weak. 6501 trivial. 0 not checked. [2019-08-05 11:11:01,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:11:01,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:11:01,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:11:01,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4764, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:11:01,065 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-08-05 11:11:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:04,579 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2019-08-05 11:11:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:11:04,579 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 337 [2019-08-05 11:11:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:04,581 INFO L225 Difference]: With dead ends: 144 [2019-08-05 11:11:04,581 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:11:04,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=206, Invalid=4764, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:11:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:11:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-05 11:11:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 11:11:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-08-05 11:11:04,585 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 337 [2019-08-05 11:11:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:04,586 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-08-05 11:11:04,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:11:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-08-05 11:11:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-08-05 11:11:04,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:04,588 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 1, 1, 1, 1, 1] [2019-08-05 11:11:04,588 INFO L418 AbstractCegarLoop]: === Iteration 72 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:11:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -851853128, now seen corresponding path program 67 times [2019-08-05 11:11:04,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:04,704 WARN L254 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 413 conjunts are in the unsatisfiable core [2019-08-05 11:11:04,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 67 proven. 4556 refuted. 0 times theorem prover too weak. 6700 trivial. 0 not checked. [2019-08-05 11:11:07,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:11:07,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:11:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:11:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4903, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:11:07,408 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-08-05 11:11:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:11,089 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2019-08-05 11:11:11,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:11:11,089 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 342 [2019-08-05 11:11:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:11,091 INFO L225 Difference]: With dead ends: 146 [2019-08-05 11:11:11,091 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:11:11,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=209, Invalid=4903, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:11:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:11:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-05 11:11:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-05 11:11:11,096 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 342 [2019-08-05 11:11:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:11,097 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-05 11:11:11,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:11:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-05 11:11:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-08-05 11:11:11,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:11,099 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 1, 1, 1, 1, 1] [2019-08-05 11:11:11,099 INFO L418 AbstractCegarLoop]: === Iteration 73 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:11:11,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash -343123330, now seen corresponding path program 68 times [2019-08-05 11:11:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:11,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 419 conjunts are in the unsatisfiable core [2019-08-05 11:11:11,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 68 proven. 4692 refuted. 0 times theorem prover too weak. 6902 trivial. 0 not checked. [2019-08-05 11:11:14,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:11:14,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:11:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:11:14,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=5044, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:11:14,399 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-08-05 11:11:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:17,949 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-08-05 11:11:17,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:11:17,949 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 347 [2019-08-05 11:11:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:17,951 INFO L225 Difference]: With dead ends: 148 [2019-08-05 11:11:17,951 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 11:11:17,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=212, Invalid=5044, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:11:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 11:11:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-05 11:11:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 11:11:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-05 11:11:17,956 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 347 [2019-08-05 11:11:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:17,957 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-05 11:11:17,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:11:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-05 11:11:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-08-05 11:11:17,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:17,958 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 1, 1, 1, 1, 1] [2019-08-05 11:11:17,959 INFO L418 AbstractCegarLoop]: === Iteration 74 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:11:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1796564496, now seen corresponding path program 69 times [2019-08-05 11:11:17,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:18,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 425 conjunts are in the unsatisfiable core [2019-08-05 11:11:18,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 69 proven. 4830 refuted. 0 times theorem prover too weak. 7107 trivial. 0 not checked. [2019-08-05 11:11:21,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:11:21,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:11:21,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:11:21,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=5187, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:11:21,177 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-08-05 11:11:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,990 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2019-08-05 11:11:24,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:11:24,990 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 352 [2019-08-05 11:11:24,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,992 INFO L225 Difference]: With dead ends: 150 [2019-08-05 11:11:24,992 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:11:24,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=215, Invalid=5187, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:11:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:11:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 11:11:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-08-05 11:11:24,997 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 352 [2019-08-05 11:11:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,998 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-08-05 11:11:24,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:11:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-08-05 11:11:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-08-05 11:11:25,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,000 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 1, 1, 1, 1, 1] [2019-08-05 11:11:25,001 INFO L418 AbstractCegarLoop]: === Iteration 75 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:11:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1215798986, now seen corresponding path program 70 times [2019-08-05 11:11:25,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,180 WARN L254 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 431 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 70 proven. 4970 refuted. 0 times theorem prover too weak. 7315 trivial. 0 not checked. [2019-08-05 11:11:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:11:28,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:11:28,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:11:28,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=5332, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:11:28,178 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-08-05 11:11:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:32,104 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-08-05 11:11:32,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:11:32,105 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 357 [2019-08-05 11:11:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:32,106 INFO L225 Difference]: With dead ends: 152 [2019-08-05 11:11:32,106 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 11:11:32,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=218, Invalid=5332, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:11:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 11:11:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 11:11:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 11:11:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-05 11:11:32,111 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 357 [2019-08-05 11:11:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:32,111 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-05 11:11:32,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:11:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-05 11:11:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-08-05 11:11:32,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:32,113 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 1, 1, 1, 1, 1] [2019-08-05 11:11:32,113 INFO L418 AbstractCegarLoop]: === Iteration 76 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:11:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1341679400, now seen corresponding path program 71 times [2019-08-05 11:11:32,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:32,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 437 conjunts are in the unsatisfiable core [2019-08-05 11:11:32,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 71 proven. 5112 refuted. 0 times theorem prover too weak. 7526 trivial. 0 not checked. [2019-08-05 11:11:35,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:35,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:11:35,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:11:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:11:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=5479, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:11:35,573 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-08-05 11:11:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:39,866 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2019-08-05 11:11:39,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:11:39,866 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 362 [2019-08-05 11:11:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:39,868 INFO L225 Difference]: With dead ends: 154 [2019-08-05 11:11:39,868 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:11:39,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=221, Invalid=5479, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:11:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:11:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-08-05 11:11:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:11:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-05 11:11:39,873 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 362 [2019-08-05 11:11:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:39,874 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-05 11:11:39,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:11:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-05 11:11:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-08-05 11:11:39,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:39,876 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 1, 1, 1, 1, 1] [2019-08-05 11:11:39,876 INFO L418 AbstractCegarLoop]: === Iteration 77 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:11:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1258814446, now seen corresponding path program 72 times [2019-08-05 11:11:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:40,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 443 conjunts are in the unsatisfiable core [2019-08-05 11:11:40,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 72 proven. 5256 refuted. 0 times theorem prover too weak. 7740 trivial. 0 not checked. [2019-08-05 11:11:43,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:43,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:11:43,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:11:43,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:11:43,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=5628, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:11:43,569 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-08-05 11:11:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:47,388 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2019-08-05 11:11:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:11:47,388 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 367 [2019-08-05 11:11:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:47,390 INFO L225 Difference]: With dead ends: 156 [2019-08-05 11:11:47,390 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 11:11:47,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=224, Invalid=5628, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:11:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 11:11:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-05 11:11:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 11:11:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-08-05 11:11:47,395 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 367 [2019-08-05 11:11:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:47,396 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-08-05 11:11:47,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:11:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-08-05 11:11:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-08-05 11:11:47,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:47,398 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 1, 1, 1, 1, 1] [2019-08-05 11:11:47,398 INFO L418 AbstractCegarLoop]: === Iteration 78 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:11:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1817892768, now seen corresponding path program 73 times [2019-08-05 11:11:47,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:47,512 WARN L254 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 449 conjunts are in the unsatisfiable core [2019-08-05 11:11:47,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 73 proven. 5402 refuted. 0 times theorem prover too weak. 7957 trivial. 0 not checked. [2019-08-05 11:11:50,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:50,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:11:50,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:11:50,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:11:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=5779, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:11:50,971 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-08-05 11:11:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:54,969 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2019-08-05 11:11:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:11:54,969 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 372 [2019-08-05 11:11:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:54,971 INFO L225 Difference]: With dead ends: 158 [2019-08-05 11:11:54,971 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:11:54,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=227, Invalid=5779, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:11:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:11:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-05 11:11:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:11:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-05 11:11:54,976 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 372 [2019-08-05 11:11:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:54,977 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-05 11:11:54,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:11:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-05 11:11:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-08-05 11:11:54,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:54,979 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 1, 1, 1, 1, 1] [2019-08-05 11:11:54,979 INFO L418 AbstractCegarLoop]: === Iteration 79 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:11:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash -960157018, now seen corresponding path program 74 times [2019-08-05 11:11:54,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:55,205 WARN L254 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 455 conjunts are in the unsatisfiable core [2019-08-05 11:11:55,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 74 proven. 5550 refuted. 0 times theorem prover too weak. 8177 trivial. 0 not checked. [2019-08-05 11:11:58,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:11:58,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:11:58,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:11:58,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=5932, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:11:58,531 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-08-05 11:12:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:02,793 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2019-08-05 11:12:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:12:02,793 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 377 [2019-08-05 11:12:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:02,795 INFO L225 Difference]: With dead ends: 160 [2019-08-05 11:12:02,795 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 11:12:02,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=230, Invalid=5932, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:12:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 11:12:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-05 11:12:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 11:12:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-05 11:12:02,800 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 377 [2019-08-05 11:12:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:02,800 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-05 11:12:02,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:12:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-05 11:12:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-08-05 11:12:02,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:02,803 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 1, 1, 1, 1, 1] [2019-08-05 11:12:02,803 INFO L418 AbstractCegarLoop]: === Iteration 80 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, MainErr2ENSURES_VIOLATIONPOST_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:12:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:02,804 INFO L82 PathProgramCache]: Analyzing trace with hash 556981656, now seen corresponding path program 75 times [2019-08-05 11:12:02,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:02,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 461 conjunts are in the unsatisfiable core [2019-08-05 11:12:02,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:12:03,460 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:12:03,461 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:12:03,466 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:12:03,466 INFO L202 PluginConnector]: Adding new model addition-correct.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:12:03 BoogieIcfgContainer [2019-08-05 11:12:03,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:12:03,468 INFO L168 Benchmark]: Toolchain (without parser) took 242991.40 ms. Allocated memory was 133.2 MB in the beginning and 648.5 MB in the end (delta: 515.4 MB). Free memory was 111.0 MB in the beginning and 215.8 MB in the end (delta: -104.9 MB). Peak memory consumption was 410.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:03,469 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:12:03,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.24 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:03,470 INFO L168 Benchmark]: Boogie Preprocessor took 19.41 ms. Allocated memory is still 133.2 MB. Free memory was 108.8 MB in the beginning and 107.9 MB in the end (delta: 900.4 kB). Peak memory consumption was 900.4 kB. Max. memory is 7.1 GB. [2019-08-05 11:12:03,470 INFO L168 Benchmark]: RCFGBuilder took 375.46 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 97.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:03,471 INFO L168 Benchmark]: TraceAbstraction took 242556.67 ms. Allocated memory was 133.2 MB in the beginning and 648.5 MB in the end (delta: 515.4 MB). Free memory was 97.5 MB in the beginning and 215.8 MB in the end (delta: -118.4 MB). Peak memory consumption was 397.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:03,474 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.21 ms. Allocated memory is still 133.2 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.24 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.41 ms. Allocated memory is still 133.2 MB. Free memory was 108.8 MB in the beginning and 107.9 MB in the end (delta: 900.4 kB). Peak memory consumption was 900.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 375.46 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 97.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242556.67 ms. Allocated memory was 133.2 MB in the beginning and 648.5 MB in the end (delta: 515.4 MB). Free memory was 97.5 MB in the beginning and 215.8 MB in the end (delta: -118.4 MB). Peak memory consumption was 397.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 383 with TraceHistMax 76,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 383 with TraceHistMax 76,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that procedure postcondition always holds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 383 with TraceHistMax 76,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 383 with TraceHistMax 76,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 383 with TraceHistMax 76,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 5 error locations. TIMEOUT Result, 242.5s OverallTime, 80 OverallIterations, 76 TraceHistogramMax, 118.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3263 SDtfs, 3086 SDslu, 146340 SDs, 0 SdLazy, 159622 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14331 GetRequests, 11326 SyntacticMatches, 0 SemanticMatches, 3005 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 111.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=79, 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.3s AutomataMinimizationTime, 79 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 118.1s InterpolantComputationTime, 14410 NumberOfCodeBlocks, 14410 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 14331 ConstructedInterpolants, 0 QuantifiedInterpolants, 19585978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 34822 ConjunctsInSsa, 17484 ConjunctsInUnsatCore, 79 InterpolantComputations, 5 PerfectInterpolantSequences, 208125/348725 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown