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/abstractInterpretation/unclassified/Fibonaccinacci_big.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:03,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:03,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:03,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:03,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:03,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:03,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:03,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:03,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:03,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:03,267 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:03,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:03,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:03,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:03,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:03,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:03,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:03,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:03,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:03,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:03,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:03,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:03,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:03,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:03,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:03,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:03,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:03,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:03,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:03,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:03,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:03,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:03,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:03,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:03,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:03,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:03,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:03,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:03,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:03,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:03,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:03,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:03,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:03,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:03,367 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:03,368 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:03,369 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/Fibonaccinacci_big.bpl [2019-08-05 11:14:03,369 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/Fibonaccinacci_big.bpl' [2019-08-05 11:14:03,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:03,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:03,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:03,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:03,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:03,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,445 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:03,445 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:03,446 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:03,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:03,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:03,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:03,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:03,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/1) ... [2019-08-05 11:14:03,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:03,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:03,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:03,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:03,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (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:14:03,539 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:14:03,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:14:03,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:14:03,790 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:03,790 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:03,791 INFO L202 PluginConnector]: Adding new model Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:03 BoogieIcfgContainer [2019-08-05 11:14:03,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:03,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:03,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:03,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:03,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:03" (1/2) ... [2019-08-05 11:14:03,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387e2f2f and model type Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:03, skipping insertion in model container [2019-08-05 11:14:03,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Fibonaccinacci_big.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:03" (2/2) ... [2019-08-05 11:14:03,801 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonaccinacci_big.bpl [2019-08-05 11:14:03,811 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:03,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:14:03,832 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:14:03,858 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:03,859 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:03,859 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:03,859 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:03,860 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:03,860 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:03,860 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:03,860 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:03,860 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:14:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:14:03,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:03,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:14:03,886 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:03,892 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:14:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:03,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:03,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,023 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:14:04,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:04,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:14:04,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:04,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:04,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:04,046 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:14:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,140 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:14:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:04,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:14:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,152 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:14:04,152 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:14:04,154 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:14:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:14:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:14:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:14:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:14:04,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:14:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,185 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:14:04,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:14:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:14:04,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:14:04,187 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:14:04,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,422 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 11:14:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:04,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:04,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:04,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:04,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:04,457 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 11:14:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,564 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:14:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:04,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:14:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,568 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:14:04,568 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:14:04,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:14:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:14:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:14:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:14:04,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 11:14:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,573 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:14:04,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:14:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:14:04,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:14:04,575 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,575 INFO L82 PathProgramCache]: Analyzing trace with hash 891446088, now seen corresponding path program 1 times [2019-08-05 11:14:04,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:14:04,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:04,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:04,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:04,676 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:14:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,740 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 11:14:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:04,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:14:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,742 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:14:04,742 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:04,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:14:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:14:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:14:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 11:14:04,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2019-08-05 11:14:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,746 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 11:14:04,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 11:14:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:04,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,747 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:14:04,747 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1980957838, now seen corresponding path program 2 times [2019-08-05 11:14:04,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:04,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:04,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:04,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:04,812 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 3 states. [2019-08-05 11:14:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,855 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 11:14:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:04,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:14:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,857 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:14:04,857 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:04,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:14:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:14:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:14:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 11:14:04,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-08-05 11:14:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,862 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 11:14:04,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 11:14:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:04,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,875 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 11:14:04,875 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1280089312, now seen corresponding path program 3 times [2019-08-05 11:14:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:05,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:05,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:05,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:05,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:05,034 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-08-05 11:14:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,171 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 11:14:05,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:05,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:14:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,172 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:14:05,172 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:14:05,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:14:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:14:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:14:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:14:05,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-08-05 11:14:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,175 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:14:05,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:14:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:14:05,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,176 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2019-08-05 11:14:05,177 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash -578925054, now seen corresponding path program 4 times [2019-08-05 11:14:05,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:05,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:05,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:05,392 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-08-05 11:14:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,451 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 11:14:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:05,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:14:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,452 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:14:05,452 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:14:05,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:14:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:14:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:14:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 11:14:05,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-08-05 11:14:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,456 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 11:14:05,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 11:14:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:05,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,457 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 11:14:05,457 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1921171744, now seen corresponding path program 5 times [2019-08-05 11:14:05,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:05,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:05,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:05,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:05,663 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-08-05 11:14:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,722 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-05 11:14:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:05,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:14:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,724 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:14:05,724 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:14:05,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:14:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:14:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:14:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:14:05,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-08-05 11:14:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,727 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:14:05,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:14:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:14:05,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,728 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1] [2019-08-05 11:14:05,729 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2114761154, now seen corresponding path program 6 times [2019-08-05 11:14:05,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:05,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:05,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:05,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:05,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:05,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:05,882 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-08-05 11:14:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:05,961 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-05 11:14:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:05,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 11:14:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:05,962 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:14:05,963 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:14:05,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:14:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:14:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 11:14:05,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2019-08-05 11:14:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:05,968 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 11:14:05,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 11:14:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:05,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:05,969 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2019-08-05 11:14:05,969 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:05,969 INFO L82 PathProgramCache]: Analyzing trace with hash -473901728, now seen corresponding path program 7 times [2019-08-05 11:14:05,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:05,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:05,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:06,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:06,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:06,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:06,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:06,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:06,438 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 9 states. [2019-08-05 11:14:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,486 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-08-05 11:14:06,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:06,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 11:14:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,487 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:14:06,488 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:14:06,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:14:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:14:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:14:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:14:06,492 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2019-08-05 11:14:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,492 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:14:06,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:14:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:14:06,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,493 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1] [2019-08-05 11:14:06,493 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,494 INFO L82 PathProgramCache]: Analyzing trace with hash 881927554, now seen corresponding path program 8 times [2019-08-05 11:14:06,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:06,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:06,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:06,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:06,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:06,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:06,700 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 10 states. [2019-08-05 11:14:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,740 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 11:14:06,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:06,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:14:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,742 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:14:06,742 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:14:06,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:14:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:14:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:14:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 11:14:06,746 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2019-08-05 11:14:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,747 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 11:14:06,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 11:14:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:06,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,748 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2019-08-05 11:14:06,748 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash -37037664, now seen corresponding path program 9 times [2019-08-05 11:14:06,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:14:06,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:06,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:06,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:06,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:06,871 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2019-08-05 11:14:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:06,936 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-08-05 11:14:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:06,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-08-05 11:14:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:06,937 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:06,937 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:06,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:14:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:14:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 11:14:06,942 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2019-08-05 11:14:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:06,942 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 11:14:06,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 11:14:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:14:06,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:06,943 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 2, 1, 1, 1] [2019-08-05 11:14:06,943 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1148229106, now seen corresponding path program 10 times [2019-08-05 11:14:06,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:06,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:06,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:14:07,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:07,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:07,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:07,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:07,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:07,199 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2019-08-05 11:14:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,359 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-08-05 11:14:07,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:07,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-08-05 11:14:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,360 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:14:07,360 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:14:07,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:14:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-08-05 11:14:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:14:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-05 11:14:07,365 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2019-08-05 11:14:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,365 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-05 11:14:07,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-05 11:14:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:14:07,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,366 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2019-08-05 11:14:07,366 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1235425440, now seen corresponding path program 11 times [2019-08-05 11:14:07,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:14:07,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:07,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:07,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:07,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:07,556 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-08-05 11:14:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,683 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-08-05 11:14:07,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:07,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-08-05 11:14:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,684 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:14:07,684 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:14:07,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:14:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-08-05 11:14:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:14:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 11:14:07,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2019-08-05 11:14:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,689 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 11:14:07,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 11:14:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:14:07,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,690 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 2, 1, 1, 1] [2019-08-05 11:14:07,690 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,690 INFO L82 PathProgramCache]: Analyzing trace with hash 356455502, now seen corresponding path program 12 times [2019-08-05 11:14:07,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:07,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:07,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:14:07,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:07,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:07,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:07,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:07,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:07,831 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 9 states. [2019-08-05 11:14:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:07,992 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-08-05 11:14:07,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:07,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 11:14:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:07,992 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:14:07,993 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:14:07,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:14:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:14:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 11:14:07,996 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2019-08-05 11:14:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:07,996 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 11:14:07,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 11:14:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:14:07,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:07,997 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2019-08-05 11:14:07,998 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:07,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1834842848, now seen corresponding path program 13 times [2019-08-05 11:14:07,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:08,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:08,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:14:08,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:08,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:08,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:08,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:08,204 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2019-08-05 11:14:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:08,335 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-08-05 11:14:08,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:14:08,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-08-05 11:14:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:08,339 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:14:08,339 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:14:08,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:14:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:14:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-08-05 11:14:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:14:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-08-05 11:14:08,342 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2019-08-05 11:14:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:08,342 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-08-05 11:14:08,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-08-05 11:14:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:14:08,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:08,343 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 2, 1, 1, 1] [2019-08-05 11:14:08,344 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1045614962, now seen corresponding path program 14 times [2019-08-05 11:14:08,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:08,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:08,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-08-05 11:14:08,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:08,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:08,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:08,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:08,417 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2019-08-05 11:14:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:08,458 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-08-05 11:14:08,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:08,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-08-05 11:14:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:08,460 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:14:08,460 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:14:08,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:14:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-08-05 11:14:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:14:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-08-05 11:14:08,464 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 20 [2019-08-05 11:14:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:08,465 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-08-05 11:14:08,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-08-05 11:14:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:14:08,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:08,466 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 3, 1, 1, 1] [2019-08-05 11:14:08,466 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1474937818, now seen corresponding path program 15 times [2019-08-05 11:14:08,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:08,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:08,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-08-05 11:14:08,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:08,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:08,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:08,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:08,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:08,877 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 7 states. [2019-08-05 11:14:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:08,973 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-08-05 11:14:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:08,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-08-05 11:14:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:08,976 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:14:08,976 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:14:08,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:14:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-08-05 11:14:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:14:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-08-05 11:14:08,982 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2019-08-05 11:14:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:08,982 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-08-05 11:14:08,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-08-05 11:14:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:14:08,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:08,983 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2019-08-05 11:14:08,984 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1521629420, now seen corresponding path program 16 times [2019-08-05 11:14:08,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 3 proven. 107 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-08-05 11:14:09,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:09,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:09,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:09,179 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-08-05 11:14:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,316 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-08-05 11:14:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:09,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 11:14:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,317 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:14:09,318 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:14:09,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:14:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-08-05 11:14:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:14:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-08-05 11:14:09,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2019-08-05 11:14:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,322 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-08-05 11:14:09,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-08-05 11:14:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:14:09,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,323 INFO L399 BasicCegarLoop]: trace histogram [16, 3, 3, 1, 1, 1] [2019-08-05 11:14:09,323 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 74066714, now seen corresponding path program 17 times [2019-08-05 11:14:09,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 3 proven. 125 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-08-05 11:14:09,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:09,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:09,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:09,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:09,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:09,467 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 9 states. [2019-08-05 11:14:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,649 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-08-05 11:14:09,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:14:09,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-05 11:14:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,652 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:14:09,652 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:14:09,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:14:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-08-05 11:14:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:14:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-08-05 11:14:09,656 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2019-08-05 11:14:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,656 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-08-05 11:14:09,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-08-05 11:14:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:14:09,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,657 INFO L399 BasicCegarLoop]: trace histogram [17, 3, 3, 1, 1, 1] [2019-08-05 11:14:09,658 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1998960684, now seen corresponding path program 18 times [2019-08-05 11:14:09,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-08-05 11:14:09,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:09,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:09,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:09,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:09,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:09,838 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2019-08-05 11:14:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:09,932 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-08-05 11:14:09,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:09,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-08-05 11:14:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:09,937 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:14:09,937 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:14:09,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:14:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-08-05 11:14:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:14:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-08-05 11:14:09,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 26 [2019-08-05 11:14:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:09,941 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-08-05 11:14:09,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-08-05 11:14:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:14:09,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:09,942 INFO L399 BasicCegarLoop]: trace histogram [18, 4, 4, 1, 1, 1] [2019-08-05 11:14:09,943 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1323705132, now seen corresponding path program 19 times [2019-08-05 11:14:09,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:09,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:09,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 46 proven. 144 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-08-05 11:14:10,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:10,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:10,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:10,083 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 10 states. [2019-08-05 11:14:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:10,422 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-08-05 11:14:10,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:14:10,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 11:14:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:10,423 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:14:10,423 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:14:10,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:14:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:14:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:14:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:14:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-08-05 11:14:10,427 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2019-08-05 11:14:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:10,428 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-08-05 11:14:10,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-08-05 11:14:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:14:10,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:10,429 INFO L399 BasicCegarLoop]: trace histogram [19, 4, 4, 1, 1, 1] [2019-08-05 11:14:10,429 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:10,429 INFO L82 PathProgramCache]: Analyzing trace with hash 307825806, now seen corresponding path program 20 times [2019-08-05 11:14:10,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:10,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:10,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 4 proven. 195 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:14:10,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:10,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:10,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:10,609 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2019-08-05 11:14:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:10,758 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-08-05 11:14:10,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:10,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 11:14:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:10,761 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:14:10,761 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:14:10,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:14:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-08-05 11:14:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:14:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-08-05 11:14:10,765 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 30 [2019-08-05 11:14:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:10,765 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-08-05 11:14:10,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-08-05 11:14:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:14:10,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:10,766 INFO L399 BasicCegarLoop]: trace histogram [20, 4, 4, 1, 1, 1] [2019-08-05 11:14:10,767 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash 952603872, now seen corresponding path program 21 times [2019-08-05 11:14:10,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:10,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:10,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 4 proven. 218 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:14:10,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:10,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:10,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:10,874 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-08-05 11:14:11,145 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 11:14:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,237 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-08-05 11:14:11,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:14:11,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-08-05 11:14:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,238 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:14:11,238 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:14:11,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:14:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:14:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-08-05 11:14:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:14:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-08-05 11:14:11,241 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 31 [2019-08-05 11:14:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,241 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-08-05 11:14:11,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-08-05 11:14:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:14:11,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,242 INFO L399 BasicCegarLoop]: trace histogram [21, 4, 4, 1, 1, 1] [2019-08-05 11:14:11,243 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,243 INFO L82 PathProgramCache]: Analyzing trace with hash -534112562, now seen corresponding path program 22 times [2019-08-05 11:14:11,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-08-05 11:14:11,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:11,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:11,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:11,369 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-08-05 11:14:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:11,400 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-08-05 11:14:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:11,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-08-05 11:14:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:11,401 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:14:11,401 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:14:11,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:14:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-08-05 11:14:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:14:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-08-05 11:14:11,404 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2019-08-05 11:14:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:11,405 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-08-05 11:14:11,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-08-05 11:14:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:14:11,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:11,406 INFO L399 BasicCegarLoop]: trace histogram [22, 5, 5, 1, 1, 1] [2019-08-05 11:14:11,406 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:11,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:11,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1098970010, now seen corresponding path program 23 times [2019-08-05 11:14:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:11,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:11,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 58 proven. 242 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-05 11:14:11,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:11,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:11,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:11,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:11,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:11,766 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2019-08-05 11:14:12,002 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2019-08-05 11:14:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:12,079 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-08-05 11:14:12,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:14:12,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-08-05 11:14:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:12,081 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:14:12,081 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:14:12,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=291, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:14:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:14:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:14:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:14:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-08-05 11:14:12,085 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 35 [2019-08-05 11:14:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:12,085 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-08-05 11:14:12,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-08-05 11:14:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:14:12,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:12,086 INFO L399 BasicCegarLoop]: trace histogram [23, 5, 5, 1, 1, 1] [2019-08-05 11:14:12,087 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1898656120, now seen corresponding path program 24 times [2019-08-05 11:14:12,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:12,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:12,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 5 proven. 314 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-08-05 11:14:12,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:12,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:12,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:12,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:12,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:12,203 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 9 states. [2019-08-05 11:14:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:12,483 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-08-05 11:14:12,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:14:12,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-08-05 11:14:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:12,484 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:14:12,484 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:14:12,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:14:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-08-05 11:14:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:14:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-08-05 11:14:12,491 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2019-08-05 11:14:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:12,491 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-08-05 11:14:12,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-08-05 11:14:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:14:12,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:12,492 INFO L399 BasicCegarLoop]: trace histogram [24, 5, 5, 1, 1, 1] [2019-08-05 11:14:12,492 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1271140902, now seen corresponding path program 25 times [2019-08-05 11:14:12,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:12,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:12,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 5 proven. 342 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-08-05 11:14:12,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:12,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:12,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:12,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:12,651 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 10 states. [2019-08-05 11:14:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:12,846 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-08-05 11:14:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:14:12,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-08-05 11:14:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:12,847 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:14:12,847 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:14:12,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=291, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:14:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:14:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-08-05 11:14:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:14:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-08-05 11:14:12,851 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 37 [2019-08-05 11:14:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:12,851 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-08-05 11:14:12,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-08-05 11:14:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:14:12,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:12,852 INFO L399 BasicCegarLoop]: trace histogram [25, 5, 5, 1, 1, 1] [2019-08-05 11:14:12,853 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 750600776, now seen corresponding path program 26 times [2019-08-05 11:14:12,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:12,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:12,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:14:13,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:13,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:13,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:13,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:13,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:13,028 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 8 states. [2019-08-05 11:14:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,059 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-08-05 11:14:13,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:13,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-08-05 11:14:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,061 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:14:13,061 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:14:13,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:14:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-08-05 11:14:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:14:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-08-05 11:14:13,065 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 38 [2019-08-05 11:14:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,065 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-08-05 11:14:13,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-08-05 11:14:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:14:13,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,066 INFO L399 BasicCegarLoop]: trace histogram [26, 6, 6, 1, 1, 1] [2019-08-05 11:14:13,066 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1540447712, now seen corresponding path program 27 times [2019-08-05 11:14:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:13,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:13,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 6 proven. 431 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-08-05 11:14:13,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:13,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:13,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:13,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:13,253 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 10 states. [2019-08-05 11:14:13,661 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2019-08-05 11:14:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:13,710 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-08-05 11:14:13,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:14:13,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-08-05 11:14:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:13,711 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:14:13,711 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:14:13,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:14:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:14:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-08-05 11:14:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:14:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-08-05 11:14:13,717 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 41 [2019-08-05 11:14:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:13,717 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-08-05 11:14:13,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-08-05 11:14:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:14:13,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:13,718 INFO L399 BasicCegarLoop]: trace histogram [27, 6, 6, 1, 1, 1] [2019-08-05 11:14:13,719 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 509177294, now seen corresponding path program 28 times [2019-08-05 11:14:13,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:13,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:13,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-08-05 11:14:14,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:14,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:14,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:14,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:14,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:14,593 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 9 states. [2019-08-05 11:14:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:14,817 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-08-05 11:14:14,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:14,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-08-05 11:14:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:14,818 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:14:14,818 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:14:14,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:14:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:14:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:14:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-08-05 11:14:14,822 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 42 [2019-08-05 11:14:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:14,822 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-08-05 11:14:14,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-08-05 11:14:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:14:14,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:14,823 INFO L399 BasicCegarLoop]: trace histogram [28, 7, 7, 1, 1, 1] [2019-08-05 11:14:14,823 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:14,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:14,823 INFO L82 PathProgramCache]: Analyzing trace with hash -931251046, now seen corresponding path program 29 times [2019-08-05 11:14:14,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:14,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:14:14,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:39,354 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 11:16:39,354 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:224) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:204) ... 39 more [2019-08-05 11:16:39,359 INFO L168 Benchmark]: Toolchain (without parser) took 155951.38 ms. Allocated memory was 133.7 MB in the beginning and 286.3 MB in the end (delta: 152.6 MB). Free memory was 110.2 MB in the beginning and 133.2 MB in the end (delta: -23.0 MB). Peak memory consumption was 129.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:39,360 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:16:39,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 133.7 MB. Free memory was 110.2 MB in the beginning and 108.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:39,362 INFO L168 Benchmark]: Boogie Preprocessor took 26.39 ms. Allocated memory is still 133.7 MB. Free memory was 108.3 MB in the beginning and 107.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:39,363 INFO L168 Benchmark]: RCFGBuilder took 316.10 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 97.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:39,363 INFO L168 Benchmark]: TraceAbstraction took 155565.06 ms. Allocated memory was 133.7 MB in the beginning and 286.3 MB in the end (delta: 152.6 MB). Free memory was 97.4 MB in the beginning and 133.2 MB in the end (delta: -35.8 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:16:39,367 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 133.7 MB. Free memory was 110.2 MB in the beginning and 108.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.39 ms. Allocated memory is still 133.7 MB. Free memory was 108.3 MB in the beginning and 107.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 316.10 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 97.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 155565.06 ms. Allocated memory was 133.7 MB in the beginning and 286.3 MB in the end (delta: 152.6 MB). Free memory was 97.4 MB in the beginning and 133.2 MB in the end (delta: -35.8 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...