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/random/RanFile098.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:06:05,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:06:05,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:06:05,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:06:05,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:06:05,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:06:05,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:06:05,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:06:05,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:06:05,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:06:05,632 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:06:05,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:06:05,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:06:05,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:06:05,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:06:05,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:06:05,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:06:05,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:06:05,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:06:05,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:06:05,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:06:05,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:06:05,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:06:05,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:06:05,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:06:05,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:06:05,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:06:05,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:06:05,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:06:05,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:06:05,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:06:05,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:06:05,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:06:05,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:06:05,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:06:05,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:06:05,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:06:05,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:06:05,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:06:05,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:06:05,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:06:05,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:06:05,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:06:05,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:06:05,726 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:06:05,727 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:06:05,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile098.bpl [2019-08-05 10:06:05,728 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile098.bpl' [2019-08-05 10:06:05,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:06:05,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:06:05,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:06:05,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:06:05,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:06:05,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,843 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:06:05,843 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:06:05,843 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:06:05,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:06:05,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:06:05,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:06:05,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:06:05,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... [2019-08-05 10:06:05,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:06:05,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:06:05,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:06:05,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:06:05,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:06:06,008 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:06:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:06:06,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:06:09,078 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:06:09,078 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:06:09,079 INFO L202 PluginConnector]: Adding new model RanFile098.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:06:09 BoogieIcfgContainer [2019-08-05 10:06:09,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:06:09,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:06:09,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:06:09,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:06:09,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:06:05" (1/2) ... [2019-08-05 10:06:09,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44189f01 and model type RanFile098.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:06:09, skipping insertion in model container [2019-08-05 10:06:09,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile098.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:06:09" (2/2) ... [2019-08-05 10:06:09,088 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile098.bpl [2019-08-05 10:06:09,097 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:06:09,105 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:06:09,117 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:06:09,142 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:06:09,142 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:06:09,143 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:06:09,143 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:06:09,143 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:06:09,143 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:06:09,145 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:06:09,145 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:06:09,145 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:06:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-08-05 10:06:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:06:09,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:09,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:09,177 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:09,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2008976665, now seen corresponding path program 1 times [2019-08-05 10:06:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:09,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjunts are in the unsatisfiable core [2019-08-05 10:06:09,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:09,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:09,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:06:09,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-08-05 10:06:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-08-05 10:06:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 10:06:09,398 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2019-08-05 10:06:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:09,419 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2019-08-05 10:06:09,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-08-05 10:06:09,421 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2019-08-05 10:06:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:09,433 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:06:09,433 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:06:09,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 10:06:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:06:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:06:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:06:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 120 transitions. [2019-08-05 10:06:09,476 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 120 transitions. Word has length 33 [2019-08-05 10:06:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:09,476 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 120 transitions. [2019-08-05 10:06:09,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-08-05 10:06:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 120 transitions. [2019-08-05 10:06:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:06:09,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:09,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:09,479 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1590121578, now seen corresponding path program 1 times [2019-08-05 10:06:09,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:09,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:06:09,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:10,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:10,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:06:10,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:06:10,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:06:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:10,389 INFO L87 Difference]: Start difference. First operand 68 states and 120 transitions. Second operand 6 states. [2019-08-05 10:06:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:12,576 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2019-08-05 10:06:12,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:06:12,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-08-05 10:06:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:12,579 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:06:12,579 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:06:12,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:06:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:06:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:06:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:06:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 121 transitions. [2019-08-05 10:06:12,590 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 121 transitions. Word has length 34 [2019-08-05 10:06:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:12,590 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 121 transitions. [2019-08-05 10:06:12,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:06:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 121 transitions. [2019-08-05 10:06:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:06:12,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:12,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:12,592 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash 992639866, now seen corresponding path program 1 times [2019-08-05 10:06:12,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:12,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:06:12,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:12,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:12,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:06:12,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:06:12,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:06:12,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:06:12,714 INFO L87 Difference]: Start difference. First operand 69 states and 121 transitions. Second operand 4 states. [2019-08-05 10:06:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:13,173 INFO L93 Difference]: Finished difference Result 128 states and 221 transitions. [2019-08-05 10:06:13,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:06:13,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-08-05 10:06:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:13,177 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:06:13,178 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:06:13,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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 10:06:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:06:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 89. [2019-08-05 10:06:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:06:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 157 transitions. [2019-08-05 10:06:13,191 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 157 transitions. Word has length 35 [2019-08-05 10:06:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:13,191 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 157 transitions. [2019-08-05 10:06:13,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:06:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 157 transitions. [2019-08-05 10:06:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:06:13,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:13,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:13,194 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash -966044304, now seen corresponding path program 1 times [2019-08-05 10:06:13,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:13,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:06:13,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:13,508 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:06:13,933 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2019-08-05 10:06:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:13,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:13,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:06:13,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:06:13,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:06:13,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:13,961 INFO L87 Difference]: Start difference. First operand 89 states and 157 transitions. Second operand 6 states. [2019-08-05 10:06:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:14,784 INFO L93 Difference]: Finished difference Result 121 states and 218 transitions. [2019-08-05 10:06:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:06:14,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-08-05 10:06:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:14,788 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:06:14,789 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:06:14,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:06:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:06:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2019-08-05 10:06:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:06:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 180 transitions. [2019-08-05 10:06:14,809 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 180 transitions. Word has length 35 [2019-08-05 10:06:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:14,809 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 180 transitions. [2019-08-05 10:06:14,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:06:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 180 transitions. [2019-08-05 10:06:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:06:14,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:14,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:14,812 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash 586266288, now seen corresponding path program 1 times [2019-08-05 10:06:14,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:14,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:06:14,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:15,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:15,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:06:15,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:06:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:06:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:15,135 INFO L87 Difference]: Start difference. First operand 101 states and 180 transitions. Second operand 5 states. [2019-08-05 10:06:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:15,577 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-08-05 10:06:15,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:06:15,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-08-05 10:06:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:15,580 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:06:15,581 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:06:15,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:06:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-08-05 10:06:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:06:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 185 transitions. [2019-08-05 10:06:15,590 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 185 transitions. Word has length 36 [2019-08-05 10:06:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:15,590 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 185 transitions. [2019-08-05 10:06:15,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:06:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 185 transitions. [2019-08-05 10:06:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:06:15,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:15,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:15,592 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1676947480, now seen corresponding path program 1 times [2019-08-05 10:06:15,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:15,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:06:15,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:16,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:16,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:06:16,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:06:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:06:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:16,063 INFO L87 Difference]: Start difference. First operand 104 states and 185 transitions. Second operand 10 states. [2019-08-05 10:06:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:16,778 INFO L93 Difference]: Finished difference Result 155 states and 280 transitions. [2019-08-05 10:06:16,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:06:16,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-08-05 10:06:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:16,783 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:06:16,783 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:06:16,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:06:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:06:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124. [2019-08-05 10:06:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:06:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 222 transitions. [2019-08-05 10:06:16,791 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 222 transitions. Word has length 36 [2019-08-05 10:06:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:16,792 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 222 transitions. [2019-08-05 10:06:16,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:06:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 222 transitions. [2019-08-05 10:06:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:06:16,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:16,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:16,794 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1925373623, now seen corresponding path program 1 times [2019-08-05 10:06:16,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:16,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:06:16,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:16,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:06:16,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:16,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:06:16,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:06:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:06:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:16,912 INFO L87 Difference]: Start difference. First operand 124 states and 222 transitions. Second operand 5 states. [2019-08-05 10:06:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:17,182 INFO L93 Difference]: Finished difference Result 139 states and 248 transitions. [2019-08-05 10:06:17,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:06:17,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-08-05 10:06:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:17,185 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:06:17,185 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:06:17,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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 10:06:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:06:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2019-08-05 10:06:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:06:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2019-08-05 10:06:17,192 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 215 transitions. Word has length 36 [2019-08-05 10:06:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:17,192 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-08-05 10:06:17,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:06:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 215 transitions. [2019-08-05 10:06:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:06:17,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:17,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:17,194 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1380683445, now seen corresponding path program 1 times [2019-08-05 10:06:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:17,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:06:17,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:17,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:17,364 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 10:06:17,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:17,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:06:17,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:06:17,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:06:17,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:17,366 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. Second operand 5 states. [2019-08-05 10:06:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:18,049 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-08-05 10:06:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:06:18,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-08-05 10:06:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:18,051 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:06:18,052 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:06:18,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 1 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 10:06:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:06:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2019-08-05 10:06:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:06:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 184 transitions. [2019-08-05 10:06:18,057 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 184 transitions. Word has length 37 [2019-08-05 10:06:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:18,058 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 184 transitions. [2019-08-05 10:06:18,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:06:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 184 transitions. [2019-08-05 10:06:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:06:18,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:18,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:18,059 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:18,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:18,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1775007069, now seen corresponding path program 1 times [2019-08-05 10:06:18,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:18,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:06:18,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:18,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:18,242 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 10:06:18,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:18,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:06:18,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:06:18,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:06:18,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:18,244 INFO L87 Difference]: Start difference. First operand 105 states and 184 transitions. Second operand 6 states. [2019-08-05 10:06:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:18,863 INFO L93 Difference]: Finished difference Result 122 states and 214 transitions. [2019-08-05 10:06:18,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:06:18,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-08-05 10:06:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:18,865 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:06:18,865 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:06:18,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:06:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2019-08-05 10:06:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:06:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 189 transitions. [2019-08-05 10:06:18,871 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 189 transitions. Word has length 38 [2019-08-05 10:06:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:18,871 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 189 transitions. [2019-08-05 10:06:18,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:06:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 189 transitions. [2019-08-05 10:06:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:06:18,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:18,872 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:18,873 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1064536639, now seen corresponding path program 1 times [2019-08-05 10:06:18,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:18,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:06:18,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:19,175 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:06:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:21,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:21,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:06:21,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:06:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:06:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2019-08-05 10:06:21,347 INFO L87 Difference]: Start difference. First operand 108 states and 189 transitions. Second operand 11 states. [2019-08-05 10:06:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:55,087 INFO L93 Difference]: Finished difference Result 255 states and 454 transitions. [2019-08-05 10:06:55,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:06:55,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-08-05 10:06:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:55,090 INFO L225 Difference]: With dead ends: 255 [2019-08-05 10:06:55,090 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 10:06:55,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=156, Invalid=537, Unknown=9, NotChecked=0, Total=702 [2019-08-05 10:06:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 10:06:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 146. [2019-08-05 10:06:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:06:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 255 transitions. [2019-08-05 10:06:55,098 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 255 transitions. Word has length 39 [2019-08-05 10:06:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:55,098 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 255 transitions. [2019-08-05 10:06:55,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:06:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 255 transitions. [2019-08-05 10:06:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:06:55,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:55,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:55,100 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash 416224506, now seen corresponding path program 1 times [2019-08-05 10:06:55,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:55,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:06:55,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:06:55,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:55,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:06:55,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:06:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:06:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:06:55,297 INFO L87 Difference]: Start difference. First operand 146 states and 255 transitions. Second operand 8 states. [2019-08-05 10:06:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:55,848 INFO L93 Difference]: Finished difference Result 154 states and 269 transitions. [2019-08-05 10:06:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:06:55,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-08-05 10:06:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:55,850 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:06:55,851 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:06:55,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:06:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:06:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2019-08-05 10:06:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:06:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 232 transitions. [2019-08-05 10:06:55,856 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 232 transitions. Word has length 39 [2019-08-05 10:06:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:55,856 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 232 transitions. [2019-08-05 10:06:55,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:06:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions. [2019-08-05 10:06:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:06:55,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:55,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:55,858 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash -25186004, now seen corresponding path program 1 times [2019-08-05 10:06:55,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:55,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:06:55,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:56,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:56,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:06:56,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:06:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:06:56,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:06:56,015 INFO L87 Difference]: Start difference. First operand 133 states and 232 transitions. Second operand 4 states. [2019-08-05 10:06:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:56,350 INFO L93 Difference]: Finished difference Result 176 states and 303 transitions. [2019-08-05 10:06:56,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:06:56,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-08-05 10:06:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:56,353 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:06:56,353 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:06:56,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:06:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-08-05 10:06:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:06:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 228 transitions. [2019-08-05 10:06:56,358 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 228 transitions. Word has length 39 [2019-08-05 10:06:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:56,359 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 228 transitions. [2019-08-05 10:06:56,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:06:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 228 transitions. [2019-08-05 10:06:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:06:56,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:56,360 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:56,365 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2000945620, now seen corresponding path program 1 times [2019-08-05 10:06:56,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:56,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:06:56,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:56,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:56,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:06:56,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:06:56,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:06:56,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:56,518 INFO L87 Difference]: Start difference. First operand 132 states and 228 transitions. Second operand 6 states. [2019-08-05 10:06:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:58,002 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2019-08-05 10:06:58,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:06:58,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-08-05 10:06:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:58,004 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:06:58,004 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:06:58,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:06:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2019-08-05 10:06:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:06:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 227 transitions. [2019-08-05 10:06:58,009 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 227 transitions. Word has length 40 [2019-08-05 10:06:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:58,010 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 227 transitions. [2019-08-05 10:06:58,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:06:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 227 transitions. [2019-08-05 10:06:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:06:58,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:58,011 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:58,013 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 827636414, now seen corresponding path program 1 times [2019-08-05 10:06:58,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:58,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:06:58,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:58,098 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 10:06:58,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:58,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:06:58,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:06:58,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:06:58,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:58,100 INFO L87 Difference]: Start difference. First operand 131 states and 227 transitions. Second operand 3 states. [2019-08-05 10:06:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:58,344 INFO L93 Difference]: Finished difference Result 150 states and 262 transitions. [2019-08-05 10:06:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:06:58,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-08-05 10:06:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:58,346 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:06:58,347 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:06:58,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 10:06:58,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:06:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-08-05 10:06:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:06:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 257 transitions. [2019-08-05 10:06:58,352 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 257 transitions. Word has length 40 [2019-08-05 10:06:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:58,352 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 257 transitions. [2019-08-05 10:06:58,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:06:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 257 transitions. [2019-08-05 10:06:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:06:58,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:58,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:58,354 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1476518853, now seen corresponding path program 1 times [2019-08-05 10:06:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:58,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:06:58,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:58,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:58,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:58,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:58,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:06:58,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:06:58,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:06:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:06:58,589 INFO L87 Difference]: Start difference. First operand 147 states and 257 transitions. Second operand 8 states. [2019-08-05 10:06:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:59,463 INFO L93 Difference]: Finished difference Result 171 states and 296 transitions. [2019-08-05 10:06:59,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:06:59,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-08-05 10:06:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:59,466 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:06:59,466 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:06:59,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:06:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2019-08-05 10:06:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:06:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 286 transitions. [2019-08-05 10:06:59,472 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 286 transitions. Word has length 40 [2019-08-05 10:06:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:59,472 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 286 transitions. [2019-08-05 10:06:59,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:06:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 286 transitions. [2019-08-05 10:06:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:06:59,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:59,474 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:59,474 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash 330105863, now seen corresponding path program 1 times [2019-08-05 10:06:59,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:59,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:06:59,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:59,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:59,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:06:59,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:06:59,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:06:59,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:59,873 INFO L87 Difference]: Start difference. First operand 164 states and 286 transitions. Second operand 12 states. [2019-08-05 10:07:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:04,104 INFO L93 Difference]: Finished difference Result 201 states and 350 transitions. [2019-08-05 10:07:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:07:04,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-08-05 10:07:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:04,107 INFO L225 Difference]: With dead ends: 201 [2019-08-05 10:07:04,107 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 10:07:04,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:07:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 10:07:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 170. [2019-08-05 10:07:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:07:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 294 transitions. [2019-08-05 10:07:04,117 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 294 transitions. Word has length 41 [2019-08-05 10:07:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:04,118 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 294 transitions. [2019-08-05 10:07:04,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:07:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 294 transitions. [2019-08-05 10:07:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:07:04,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:04,119 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:04,119 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash -704955166, now seen corresponding path program 1 times [2019-08-05 10:07:04,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:04,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:07:04,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:04,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:04,273 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 10:07:04,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:04,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:07:04,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:04,274 INFO L87 Difference]: Start difference. First operand 170 states and 294 transitions. Second operand 4 states. [2019-08-05 10:07:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:04,535 INFO L93 Difference]: Finished difference Result 204 states and 347 transitions. [2019-08-05 10:07:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:04,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-08-05 10:07:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:04,538 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:07:04,538 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:07:04,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:07:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 165. [2019-08-05 10:07:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:07:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 278 transitions. [2019-08-05 10:07:04,543 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 278 transitions. Word has length 41 [2019-08-05 10:07:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:04,543 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 278 transitions. [2019-08-05 10:07:04,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 278 transitions. [2019-08-05 10:07:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:07:04,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:04,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:04,545 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:04,545 INFO L82 PathProgramCache]: Analyzing trace with hash -690879927, now seen corresponding path program 1 times [2019-08-05 10:07:04,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:04,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:04,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:04,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:04,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:04,944 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-08-05 10:07:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:04,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:04,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:07:04,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:07:04,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:07:04,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:04,994 INFO L87 Difference]: Start difference. First operand 165 states and 278 transitions. Second operand 7 states. [2019-08-05 10:07:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:05,858 INFO L93 Difference]: Finished difference Result 208 states and 354 transitions. [2019-08-05 10:07:05,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:07:05,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-08-05 10:07:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:05,859 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:07:05,859 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 10:07:05,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 10:07:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 173. [2019-08-05 10:07:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:07:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 291 transitions. [2019-08-05 10:07:05,865 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 291 transitions. Word has length 41 [2019-08-05 10:07:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:05,866 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 291 transitions. [2019-08-05 10:07:05,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:07:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 291 transitions. [2019-08-05 10:07:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:07:05,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:05,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:05,867 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash -105990348, now seen corresponding path program 1 times [2019-08-05 10:07:05,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:05,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:07:05,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:06,090 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:07:06,291 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:07:06,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:06,833 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-08-05 10:07:06,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:07,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:07,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:07:07,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:07:07,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:07:07,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:07,060 INFO L87 Difference]: Start difference. First operand 173 states and 291 transitions. Second operand 10 states. [2019-08-05 10:07:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:09,274 INFO L93 Difference]: Finished difference Result 189 states and 318 transitions. [2019-08-05 10:07:09,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:07:09,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-08-05 10:07:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:09,276 INFO L225 Difference]: With dead ends: 189 [2019-08-05 10:07:09,276 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 10:07:09,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 10:07:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2019-08-05 10:07:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:07:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 299 transitions. [2019-08-05 10:07:09,282 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 299 transitions. Word has length 41 [2019-08-05 10:07:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:09,282 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 299 transitions. [2019-08-05 10:07:09,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:07:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 299 transitions. [2019-08-05 10:07:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:07:09,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:09,283 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:09,284 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash -70919840, now seen corresponding path program 1 times [2019-08-05 10:07:09,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:09,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:07:09,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:13,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:13,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:07:13,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:07:13,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:07:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=83, Unknown=4, NotChecked=0, Total=110 [2019-08-05 10:07:13,161 INFO L87 Difference]: Start difference. First operand 177 states and 299 transitions. Second operand 11 states. [2019-08-05 10:08:10,615 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-08-05 10:08:11,656 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-08-05 10:08:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:24,750 INFO L93 Difference]: Finished difference Result 262 states and 444 transitions. [2019-08-05 10:08:24,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:08:24,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-08-05 10:08:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:24,751 INFO L225 Difference]: With dead ends: 262 [2019-08-05 10:08:24,752 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:08:24,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=39, Invalid=139, Unknown=4, NotChecked=0, Total=182 [2019-08-05 10:08:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:08:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 195. [2019-08-05 10:08:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-08-05 10:08:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 328 transitions. [2019-08-05 10:08:24,757 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 328 transitions. Word has length 42 [2019-08-05 10:08:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:24,757 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 328 transitions. [2019-08-05 10:08:24,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:08:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 328 transitions. [2019-08-05 10:08:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:08:24,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:24,758 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:24,759 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash -608582470, now seen corresponding path program 1 times [2019-08-05 10:08:24,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:24,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:08:24,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:08:24,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:24,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:08:24,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:08:24,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:08:24,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:08:24,824 INFO L87 Difference]: Start difference. First operand 195 states and 328 transitions. Second operand 3 states. [2019-08-05 10:08:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:25,225 INFO L93 Difference]: Finished difference Result 197 states and 330 transitions. [2019-08-05 10:08:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:08:25,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-08-05 10:08:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:25,227 INFO L225 Difference]: With dead ends: 197 [2019-08-05 10:08:25,227 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:08:25,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 10:08:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:08:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 10:08:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:08:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 289 transitions. [2019-08-05 10:08:25,232 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 289 transitions. Word has length 42 [2019-08-05 10:08:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:25,233 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 289 transitions. [2019-08-05 10:08:25,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:08:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 289 transitions. [2019-08-05 10:08:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:08:25,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:25,234 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:25,234 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1787539970, now seen corresponding path program 1 times [2019-08-05 10:08:25,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:25,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:08:25,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:08:25,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:25,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:08:25,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:25,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:25,387 INFO L87 Difference]: Start difference. First operand 176 states and 289 transitions. Second operand 9 states. [2019-08-05 10:08:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:30,946 INFO L93 Difference]: Finished difference Result 329 states and 522 transitions. [2019-08-05 10:08:30,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:08:30,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-08-05 10:08:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:30,951 INFO L225 Difference]: With dead ends: 329 [2019-08-05 10:08:30,951 INFO L226 Difference]: Without dead ends: 329 [2019-08-05 10:08:30,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:08:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-08-05 10:08:30,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 223. [2019-08-05 10:08:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 10:08:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 359 transitions. [2019-08-05 10:08:30,957 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 359 transitions. Word has length 42 [2019-08-05 10:08:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:30,957 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 359 transitions. [2019-08-05 10:08:30,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 359 transitions. [2019-08-05 10:08:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:08:30,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:30,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:30,959 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1865534718, now seen corresponding path program 1 times [2019-08-05 10:08:30,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:30,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:08:30,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:31,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:08:31,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:31,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:08:31,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:08:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:08:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:08:31,229 INFO L87 Difference]: Start difference. First operand 223 states and 359 transitions. Second operand 10 states. [2019-08-05 10:08:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:32,160 INFO L93 Difference]: Finished difference Result 251 states and 400 transitions. [2019-08-05 10:08:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:08:32,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-08-05 10:08:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:32,163 INFO L225 Difference]: With dead ends: 251 [2019-08-05 10:08:32,163 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:08:32,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:08:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:08:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 208. [2019-08-05 10:08:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:08:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 334 transitions. [2019-08-05 10:08:32,168 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 334 transitions. Word has length 42 [2019-08-05 10:08:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:32,168 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 334 transitions. [2019-08-05 10:08:32,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:08:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 334 transitions. [2019-08-05 10:08:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:08:32,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:32,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:32,170 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:32,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:32,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1424124208, now seen corresponding path program 1 times [2019-08-05 10:08:32,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:32,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:08:32,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:32,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:08:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:32,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:32,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:08:32,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:08:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:08:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:08:32,457 INFO L87 Difference]: Start difference. First operand 208 states and 334 transitions. Second operand 9 states. [2019-08-05 10:08:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:32,866 INFO L93 Difference]: Finished difference Result 235 states and 377 transitions. [2019-08-05 10:08:32,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:08:32,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-08-05 10:08:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:32,869 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:08:32,869 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 10:08:32,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:08:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 10:08:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2019-08-05 10:08:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:08:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 320 transitions. [2019-08-05 10:08:32,874 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 320 transitions. Word has length 42 [2019-08-05 10:08:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:32,874 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 320 transitions. [2019-08-05 10:08:32,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:08:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 320 transitions. [2019-08-05 10:08:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:08:32,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:32,875 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:32,875 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1818332344, now seen corresponding path program 1 times [2019-08-05 10:08:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:32,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:08:32,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:33,710 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-08-05 10:09:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:05,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:05,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:09:05,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:09:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:09:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=245, Unknown=2, NotChecked=0, Total=306 [2019-08-05 10:09:05,804 INFO L87 Difference]: Start difference. First operand 200 states and 320 transitions. Second operand 18 states. [2019-08-05 10:09:12,000 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-08-05 10:09:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:22,087 INFO L93 Difference]: Finished difference Result 291 states and 459 transitions. [2019-08-05 10:09:22,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:09:22,090 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2019-08-05 10:09:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:22,092 INFO L225 Difference]: With dead ends: 291 [2019-08-05 10:09:22,092 INFO L226 Difference]: Without dead ends: 211 [2019-08-05 10:09:22,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=84, Invalid=376, Unknown=2, NotChecked=0, Total=462 [2019-08-05 10:09:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-05 10:09:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2019-08-05 10:09:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:09:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 332 transitions. [2019-08-05 10:09:22,096 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 332 transitions. Word has length 42 [2019-08-05 10:09:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:22,097 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 332 transitions. [2019-08-05 10:09:22,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:09:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 332 transitions. [2019-08-05 10:09:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:09:22,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:22,098 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:22,098 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:22,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1263595923, now seen corresponding path program 1 times [2019-08-05 10:09:22,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:22,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:09:22,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:09:24,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:24,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:09:24,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:09:24,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:09:24,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:24,716 INFO L87 Difference]: Start difference. First operand 208 states and 332 transitions. Second operand 16 states. [2019-08-05 10:10:26,726 WARN L188 SmtUtils]: Spent 4.33 s on a formula simplification that was a NOOP. DAG size: 90 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown