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/real-life/PricedTimedAutomata/handwritten/pcatest0.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:13:03,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:13:03,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:13:03,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:13:03,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:13:03,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:13:03,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:13:03,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:13:03,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:13:03,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:13:03,658 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:13:03,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:13:03,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:13:03,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:13:03,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:13:03,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:13:03,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:13:03,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:13:03,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:13:03,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:13:03,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:13:03,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:13:03,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:13:03,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:13:03,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:13:03,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:13:03,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:13:03,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:13:03,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:13:03,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:13:03,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:13:03,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:13:03,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:13:03,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:13:03,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:13:03,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:13:03,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:13:03,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:13:03,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:13:03,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:13:03,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:13:03,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:13:03,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:13:03,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:13:03,757 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:13:03,757 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:13:03,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/handwritten/pcatest0.bpl [2019-08-05 10:13:03,758 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/handwritten/pcatest0.bpl' [2019-08-05 10:13:03,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:13:03,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:13:03,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:03,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:13:03,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:13:03,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,827 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:13:03,828 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:13:03,828 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:13:03,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:03,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:13:03,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:13:03,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:13:03,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:13:03,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:13:03,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:13:03,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:13:03,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:13:03,916 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:13:03,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:13:03,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:13:04,186 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:13:04,187 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:13:04,188 INFO L202 PluginConnector]: Adding new model pcatest0.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:04 BoogieIcfgContainer [2019-08-05 10:13:04,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:13:04,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:13:04,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:13:04,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:13:04,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/2) ... [2019-08-05 10:13:04,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ced06b6 and model type pcatest0.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:13:04, skipping insertion in model container [2019-08-05 10:13:04,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pcatest0.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:04" (2/2) ... [2019-08-05 10:13:04,198 INFO L109 eAbstractionObserver]: Analyzing ICFG pcatest0.bpl [2019-08-05 10:13:04,209 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:13:04,217 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:13:04,237 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:13:04,268 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:13:04,269 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:13:04,269 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:13:04,270 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:13:04,270 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:13:04,270 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:13:04,270 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:13:04,270 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:13:04,270 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:13:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:13:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:13:04,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:04,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:13:04,310 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 10:13:04,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:04,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:13:04,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:04,499 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:13:04,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:04,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:04,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:04,520 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 10:13:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:04,663 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:13:04,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:04,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:13:04,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:04,675 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:13:04,675 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:13:04,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:13:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:13:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:13:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:13:04,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 10:13:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:04,711 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:13:04,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:13:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:13:04,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:04,712 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:13:04,713 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 10:13:04,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:04,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:04,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:04,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:04,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:13:04,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:04,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:04,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:04,845 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:13:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:04,906 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:13:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:04,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:13:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:04,907 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:13:04,907 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:13:04,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:13:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:13:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 10:13:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:13:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:13:04,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 10:13:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:04,912 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:13:04,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:13:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:13:04,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:04,913 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 10:13:04,913 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:04,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 10:13:04,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:04,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:04,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,053 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:13:05,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:05,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:13:05,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:05,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:05,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:05,058 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 10:13:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,116 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:13:05,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:05,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:13:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,118 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:13:05,119 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:13:05,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:13:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:13:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:13:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:13:05,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:13:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,123 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:13:05,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:13:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:13:05,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,125 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 10:13:05,125 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 10:13:05,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:05,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:05,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:05,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:05,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:05,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:05,379 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-05 10:13:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,528 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:13:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:13:05,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:13:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,530 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:13:05,530 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:13:05,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:13:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 10:13:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:13:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:13:05,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:13:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,534 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:13:05,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:13:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:13:05,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,535 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 10:13:05,535 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 10:13:05,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:05,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:05,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:05,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:05,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:05,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:05,711 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-08-05 10:13:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,800 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:13:05,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:13:05,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 10:13:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,803 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:13:05,804 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:13:05,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:13:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 10:13:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:13:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:13:05,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:13:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,808 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:13:05,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:13:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:05,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,810 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 10:13:05,810 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 10:13:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:06,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:06,047 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2019-08-05 10:13:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,130 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:13:06,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:13:06,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 10:13:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,131 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:13:06,132 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:13:06,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:13:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 10:13:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:13:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:13:06,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:13:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,136 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:13:06,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:13:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:13:06,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,137 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 10:13:06,138 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 10:13:06,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:13:06,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:13:06,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:13:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:13:06,354 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-08-05 10:13:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,583 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:13:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:13:06,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-08-05 10:13:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,585 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:13:06,585 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:13:06,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:13:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:13:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 10:13:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:13:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:13:06,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 10:13:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,591 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:13:06,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:13:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:13:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:13:06,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,592 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 10:13:06,593 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 10:13:06,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:13:06,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:13:06,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:13:06,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:06,854 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-08-05 10:13:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,923 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:13:06,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:13:06,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-08-05 10:13:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,925 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:13:06,925 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:13:06,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:13:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 10:13:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:13:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:13:06,930 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 10:13:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,930 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:13:06,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:13:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:13:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:13:06,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,931 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 10:13:06,931 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 10:13:06,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:07,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:07,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:13:07,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:13:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:13:07,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:07,119 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 12 states. [2019-08-05 10:13:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,193 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:13:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:07,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-08-05 10:13:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,195 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:13:07,195 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:13:07,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:13:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 10:13:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:13:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:13:07,200 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 10:13:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,201 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:13:07,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:13:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:13:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:13:07,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,202 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 10:13:07,202 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 10:13:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:07,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:07,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:13:07,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:13:07,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:13:07,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:13:07,554 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 13 states. [2019-08-05 10:13:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,626 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:13:07,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:07,626 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-08-05 10:13:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,627 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:13:07,627 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:13:07,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:13:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:13:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 10:13:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:13:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:13:07,632 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 10:13:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,632 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:13:07,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:13:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:13:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:13:07,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,633 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 10:13:07,633 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-08-05 10:13:07,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:07,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:07,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:13:07,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:13:07,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:13:07,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:07,937 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 14 states. [2019-08-05 10:13:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,073 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:13:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:08,073 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-08-05 10:13:08,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,074 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:13:08,074 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:13:08,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:13:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 10:13:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:13:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:13:08,078 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 10:13:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,078 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:13:08,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:13:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:13:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:13:08,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,079 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 10:13:08,079 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,080 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-08-05 10:13:08,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:08,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:08,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:13:08,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:13:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:13:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:13:08,404 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 15 states. [2019-08-05 10:13:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,706 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:13:08,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:13:08,707 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-08-05 10:13:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,708 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:13:08,708 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:13:08,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:13:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:13:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 10:13:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:13:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:13:08,713 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 10:13:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,713 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:13:08,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:13:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:13:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:13:08,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,714 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 10:13:08,714 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-08-05 10:13:08,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:09,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:13:09,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:13:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:13:09,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:13:09,231 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 16 states. [2019-08-05 10:13:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,288 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:13:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:09,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-08-05 10:13:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,289 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:13:09,289 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:13:09,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:13:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:13:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 10:13:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:13:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:13:09,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 10:13:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,294 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:13:09,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:13:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:13:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:13:09,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,296 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 10:13:09,296 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-08-05 10:13:09,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:09,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:13:09,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:13:09,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:13:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:09,574 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 17 states. [2019-08-05 10:13:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,635 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:13:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:13:09,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-08-05 10:13:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,636 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:13:09,636 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:13:09,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:13:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 10:13:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:13:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:13:09,641 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 10:13:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,641 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:13:09,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:13:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:13:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:13:09,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,642 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 10:13:09,642 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-08-05 10:13:09,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:09,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:13:09,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:13:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:13:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:13:09,859 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 18 states. [2019-08-05 10:13:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,919 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:13:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:13:09,919 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-08-05 10:13:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,920 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:13:09,920 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:13:09,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:13:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:13:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 10:13:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:13:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:13:09,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 10:13:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,925 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:13:09,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:13:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:13:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:13:09,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,925 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 10:13:09,926 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,926 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-08-05 10:13:09,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:10,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:10,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:13:10,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:13:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:13:10,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:10,807 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 19 states. [2019-08-05 10:13:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:10,900 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:13:10,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:13:10,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2019-08-05 10:13:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:10,901 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:13:10,901 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:13:10,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:13:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 10:13:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:13:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:13:10,906 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 10:13:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:10,906 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:13:10,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:13:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:13:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:13:10,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:10,907 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 10:13:10,908 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-08-05 10:13:10,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:10,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:13:10,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:11,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:11,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:13:11,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:13:11,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:13:11,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:11,223 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 20 states. [2019-08-05 10:13:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:11,283 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:13:11,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:13:11,283 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-08-05 10:13:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:11,284 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:13:11,284 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:13:11,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:13:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 10:13:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:13:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:13:11,289 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 10:13:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:11,289 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:13:11,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:13:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:13:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:13:11,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:11,291 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 10:13:11,291 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-08-05 10:13:11,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:11,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:13:11,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:11,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:11,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:13:11,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:13:11,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:13:11,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:11,564 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 21 states. [2019-08-05 10:13:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:11,639 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:13:11,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:13:11,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-08-05 10:13:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:11,641 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:13:11,641 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:13:11,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:13:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 10:13:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:13:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:13:11,646 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 10:13:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:11,646 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:13:11,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:13:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:13:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:13:11,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:11,647 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 10:13:11,648 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:11,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-08-05 10:13:11,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:11,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:13:11,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:11,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:11,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:13:11,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:13:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:13:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:11,997 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 22 states. [2019-08-05 10:13:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,129 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:13:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:13:12,130 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-08-05 10:13:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,131 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:13:12,131 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:13:12,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:13:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 10:13:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:13:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:13:12,135 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 10:13:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,135 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:13:12,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:13:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:13:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:13:12,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:12,136 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 10:13:12,136 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-08-05 10:13:12,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:12,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:13:12,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:12,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:12,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:13:12,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:13:12,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:13:12,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:12,710 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 23 states. [2019-08-05 10:13:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,808 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:13:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:13:12,808 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2019-08-05 10:13:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,809 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:13:12,809 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:13:12,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:13:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 10:13:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:13:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:13:12,814 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 10:13:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,815 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:13:12,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:13:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:13:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:13:12,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:12,816 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 10:13:12,816 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-08-05 10:13:12,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:12,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:13:12,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:13,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:13,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:13:13,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:13:13,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:13:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:13,172 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 24 states. [2019-08-05 10:13:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:13,383 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:13:13,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:13:13,384 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-08-05 10:13:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:13,384 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:13:13,384 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:13:13,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:13:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 10:13:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:13:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:13:13,389 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 10:13:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:13,389 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:13:13,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:13:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:13:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:13:13,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:13,390 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 10:13:13,391 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-08-05 10:13:13,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:13,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:13:13,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:13,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:13,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:13:13,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:13:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:13:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:13:13,798 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 25 states. [2019-08-05 10:13:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:13,887 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:13:13,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:13:13,889 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2019-08-05 10:13:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:13,890 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:13:13,891 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:13:13,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:13:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:13:13,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 10:13:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:13:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:13:13,895 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 10:13:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:13,896 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:13:13,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:13:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:13:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:13:13,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:13,897 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 10:13:13,897 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:13,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:13,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-08-05 10:13:13,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:13,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:13:13,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:15,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:15,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:13:15,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:13:15,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:13:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:15,962 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 26 states. [2019-08-05 10:13:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:16,049 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:13:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:13:16,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2019-08-05 10:13:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:16,051 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:13:16,051 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:13:16,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:13:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 10:13:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:13:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:13:16,055 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 10:13:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:16,055 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:13:16,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:13:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:13:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:13:16,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:16,057 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 10:13:16,057 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-08-05 10:13:16,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:16,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:16,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:17,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:17,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:17,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:17,458 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 27 states. [2019-08-05 10:13:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:17,536 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:13:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:13:17,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 49 [2019-08-05 10:13:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:17,544 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:13:17,545 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:13:17,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:13:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 10:13:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:13:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:13:17,548 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 10:13:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:17,548 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:13:17,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:13:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:13:17,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:17,549 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 10:13:17,550 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-08-05 10:13:17,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:17,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:13:17,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:18,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:18,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:18,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:18,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:18,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:18,135 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 28 states. [2019-08-05 10:13:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:18,211 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:13:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:13:18,211 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-08-05 10:13:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:18,212 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:13:18,212 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:13:18,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:13:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 10:13:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:13:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:13:18,216 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 10:13:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:18,216 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:13:18,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:13:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:13:18,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:18,217 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 10:13:18,218 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:18,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-08-05 10:13:18,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:18,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:13:18,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:18,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:18,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:13:18,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:13:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:13:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:13:18,882 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 29 states. [2019-08-05 10:13:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:19,066 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:13:19,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:13:19,067 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2019-08-05 10:13:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:19,068 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:13:19,068 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:13:19,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:13:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:13:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 10:13:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:13:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:13:19,072 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 10:13:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:19,072 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:13:19,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:13:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:13:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:13:19,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:19,073 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 10:13:19,073 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:19,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-08-05 10:13:19,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:19,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:13:19,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:19,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:19,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:13:19,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:13:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:13:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:13:19,498 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 30 states. [2019-08-05 10:13:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:19,700 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:13:19,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:13:19,700 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-08-05 10:13:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:19,701 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:13:19,701 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:13:19,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:13:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:13:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 10:13:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:13:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:13:19,705 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 10:13:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:19,706 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:13:19,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:13:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:13:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:13:19,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:19,706 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 10:13:19,707 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:19,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-08-05 10:13:19,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:19,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:13:19,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:20,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:20,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:13:20,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:13:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:13:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:13:20,408 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 31 states. [2019-08-05 10:13:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:20,531 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:13:20,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:13:20,532 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-08-05 10:13:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:20,533 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:13:20,533 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:13:20,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:13:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:13:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 10:13:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:13:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:13:20,537 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 10:13:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:20,537 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:13:20,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:13:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:13:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:13:20,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:20,538 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 10:13:20,539 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-08-05 10:13:20,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:20,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:13:20,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:21,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:21,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:21,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:21,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:21,269 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 32 states. [2019-08-05 10:13:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:21,368 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:13:21,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:13:21,369 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2019-08-05 10:13:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:21,370 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:13:21,370 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:13:21,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:13:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 10:13:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:13:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:13:21,374 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 10:13:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:21,374 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:13:21,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:13:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:13:21,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:21,375 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 10:13:21,376 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-08-05 10:13:21,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:21,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:13:21,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:21,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:21,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:13:21,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:13:21,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:13:21,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:13:21,919 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 33 states. [2019-08-05 10:13:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:22,112 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:13:22,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:13:22,113 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2019-08-05 10:13:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:22,113 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:13:22,114 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:13:22,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:13:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:13:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 10:13:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:13:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:13:22,117 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 10:13:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:22,117 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:13:22,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:13:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:13:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:13:22,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:22,118 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 10:13:22,119 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:22,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-08-05 10:13:22,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:22,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:13:22,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:22,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:22,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:22,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:22,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:22,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:22,977 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 34 states. [2019-08-05 10:13:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:23,080 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:13:23,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:13:23,080 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 63 [2019-08-05 10:13:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:23,081 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:13:23,081 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:13:23,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:13:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 10:13:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:13:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:13:23,085 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 10:13:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:23,085 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:13:23,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:13:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:13:23,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:23,086 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 10:13:23,086 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-08-05 10:13:23,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:23,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:13:23,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:23,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:23,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:23,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:23,743 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 35 states. [2019-08-05 10:13:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:23,850 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:13:23,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:13:23,850 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2019-08-05 10:13:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:23,851 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:13:23,852 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:13:23,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:13:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 10:13:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:13:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:13:23,855 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 10:13:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:23,856 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:13:23,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:13:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:13:23,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:23,857 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 10:13:23,857 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:23,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:23,857 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-08-05 10:13:23,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:23,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:13:23,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:24,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:24,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:13:24,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:13:24,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:13:24,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:13:24,477 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 36 states. [2019-08-05 10:13:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:24,587 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:13:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:13:24,588 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2019-08-05 10:13:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:24,589 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:13:24,589 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:13:24,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:13:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:13:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 10:13:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:13:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:13:24,592 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 10:13:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:24,593 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:13:24,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:13:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:13:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:13:24,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:24,594 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 10:13:24,594 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:24,594 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-08-05 10:13:24,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:24,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:13:24,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:25,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:25,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:13:25,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:13:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:13:25,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:13:25,289 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 37 states. [2019-08-05 10:13:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,443 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:13:25,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:13:25,444 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 69 [2019-08-05 10:13:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,445 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:13:25,445 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:13:25,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:13:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:13:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 10:13:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:13:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:13:25,448 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 10:13:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,449 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:13:25,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:13:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:13:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:13:25,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,449 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-08-05 10:13:25,449 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-08-05 10:13:25,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:26,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:26,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:13:26,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:13:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:13:26,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:13:26,692 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 38 states. [2019-08-05 10:13:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:26,835 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:13:26,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:13:26,835 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 71 [2019-08-05 10:13:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:26,836 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:13:26,836 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:13:26,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:13:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:13:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 10:13:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:13:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:13:26,840 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 10:13:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:26,841 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:13:26,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:13:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:13:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:13:26,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:26,842 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-08-05 10:13:26,842 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:26,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-08-05 10:13:26,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:26,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:13:26,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:27,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:27,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:13:27,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:13:27,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:13:27,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:13:27,613 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 39 states. [2019-08-05 10:13:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,723 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:13:27,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:13:27,724 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2019-08-05 10:13:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,724 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:13:27,725 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:13:27,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:13:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:13:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 10:13:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:13:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:13:27,728 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 10:13:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,728 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:13:27,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:13:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:13:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:13:27,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,728 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-08-05 10:13:27,729 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-08-05 10:13:27,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:28,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:28,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:13:28,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:13:28,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:13:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:13:28,374 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 40 states. [2019-08-05 10:13:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,487 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:13:28,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:28,487 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2019-08-05 10:13:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,488 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:13:28,489 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:13:28,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:13:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:13:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 10:13:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:13:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:13:28,492 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 10:13:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,492 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:13:28,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:13:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:13:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:13:28,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,493 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-08-05 10:13:28,493 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,494 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-08-05 10:13:28,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:28,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:13:28,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:29,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:29,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:13:29,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:13:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:13:29,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:13:29,151 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 41 states. [2019-08-05 10:13:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:29,267 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:13:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:13:29,268 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2019-08-05 10:13:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:29,269 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:13:29,269 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:13:29,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:13:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:13:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 10:13:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:13:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:13:29,272 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 10:13:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:29,272 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:13:29,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:13:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:13:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:13:29,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:29,273 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-08-05 10:13:29,273 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-08-05 10:13:29,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:29,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:13:29,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:30,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:30,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:13:30,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:13:30,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:13:30,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:13:30,273 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 42 states. [2019-08-05 10:13:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:30,389 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:13:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:13:30,390 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2019-08-05 10:13:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:30,391 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:13:30,391 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:13:30,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:13:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:13:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 10:13:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:13:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:13:30,394 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 10:13:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:30,394 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:13:30,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:13:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:13:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:13:30,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:30,394 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-08-05 10:13:30,395 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-08-05 10:13:30,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:30,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:13:30,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:31,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:31,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:13:31,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:13:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:13:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:13:31,882 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 43 states. [2019-08-05 10:13:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,023 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:13:32,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:13:32,023 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2019-08-05 10:13:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:32,024 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:13:32,024 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:13:32,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:13:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:13:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 10:13:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:13:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:13:32,028 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 10:13:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:32,028 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:13:32,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:13:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:13:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:13:32,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:32,029 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-08-05 10:13:32,029 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-08-05 10:13:32,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:32,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:13:32,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:32,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:32,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:13:32,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:13:32,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:13:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:13:32,739 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 44 states. [2019-08-05 10:13:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,862 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:13:32,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:13:32,862 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2019-08-05 10:13:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:32,863 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:13:32,864 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:13:32,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:13:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:13:32,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 10:13:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:13:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:13:32,868 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 10:13:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:32,868 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:13:32,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:13:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:13:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:13:32,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:32,869 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-08-05 10:13:32,869 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:32,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:32,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-08-05 10:13:32,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:32,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:13:32,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:33,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:33,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:13:33,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:13:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:13:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:13:33,813 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 45 states. [2019-08-05 10:13:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:33,952 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:13:33,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:13:33,953 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-08-05 10:13:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:33,954 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:13:33,954 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:13:33,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:13:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:13:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 10:13:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:13:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:13:33,958 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 10:13:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:33,958 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:13:33,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:13:33,958 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:13:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:13:33,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:33,959 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-08-05 10:13:33,959 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:33,959 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-08-05 10:13:33,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:33,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:13:33,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:34,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:34,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:13:34,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:13:34,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:13:34,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:13:34,905 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 46 states. [2019-08-05 10:13:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:35,037 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:13:35,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:13:35,038 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2019-08-05 10:13:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:35,039 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:13:35,039 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:13:35,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:13:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:13:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 10:13:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:13:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:13:35,043 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 10:13:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:35,044 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:13:35,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:13:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:13:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:13:35,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:35,045 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-08-05 10:13:35,045 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-08-05 10:13:35,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:35,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:13:35,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:35,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:35,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:13:35,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:13:35,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:13:35,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:13:35,849 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 47 states. [2019-08-05 10:13:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:36,258 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:13:36,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:13:36,258 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 89 [2019-08-05 10:13:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:36,259 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:13:36,259 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:13:36,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:13:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:13:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-08-05 10:13:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:13:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:13:36,261 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 10:13:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:36,261 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:13:36,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:13:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:13:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:13:36,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:36,262 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-08-05 10:13:36,263 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:36,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-08-05 10:13:36,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:36,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:13:36,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:37,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:37,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:13:37,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:13:37,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:13:37,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:13:37,293 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 48 states. [2019-08-05 10:13:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:37,431 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:13:37,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:13:37,431 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2019-08-05 10:13:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:37,432 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:13:37,432 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:13:37,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:13:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:13:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 10:13:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:13:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:13:37,436 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 10:13:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:37,436 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:13:37,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:13:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:13:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:13:37,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:37,437 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-08-05 10:13:37,437 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-08-05 10:13:37,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:37,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:13:37,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:38,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:38,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:13:38,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:13:38,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:13:38,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:13:38,396 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 49 states. [2019-08-05 10:13:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:38,530 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:13:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:13:38,530 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 93 [2019-08-05 10:13:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:38,532 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:13:38,532 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:13:38,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:13:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:13:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 10:13:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:13:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:13:38,536 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 10:13:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:38,536 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:13:38,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:13:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:13:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:13:38,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:38,537 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-08-05 10:13:38,538 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-08-05 10:13:38,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:38,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:13:38,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:40,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:40,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:13:40,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:13:40,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:13:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:13:40,126 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 50 states. [2019-08-05 10:13:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:40,265 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:13:40,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:13:40,265 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 95 [2019-08-05 10:13:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:40,266 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:13:40,266 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:13:40,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:13:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:13:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 10:13:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:13:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:13:40,269 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 10:13:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:40,270 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:13:40,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:13:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:13:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:13:40,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:40,270 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-08-05 10:13:40,270 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-08-05 10:13:40,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:40,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:13:40,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:41,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:41,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:13:41,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:13:41,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:13:41,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:13:41,833 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 51 states. [2019-08-05 10:13:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:41,975 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:13:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:13:41,975 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 97 [2019-08-05 10:13:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:41,976 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:13:41,976 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:13:41,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:13:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:13:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-08-05 10:13:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:13:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:13:41,980 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 10:13:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:41,980 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:13:41,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:13:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:13:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:13:41,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:41,981 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-08-05 10:13:41,981 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-08-05 10:13:41,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:42,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:13:42,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:43,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:43,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:13:43,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:13:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:13:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:13:43,310 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 52 states. [2019-08-05 10:13:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:43,450 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:13:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:13:43,451 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2019-08-05 10:13:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:43,452 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:13:43,452 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:13:43,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:13:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:13:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 10:13:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:13:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:13:43,455 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 10:13:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:43,456 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:13:43,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:13:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:13:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:13:43,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:43,457 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-08-05 10:13:43,457 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-08-05 10:13:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:13:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:13:43,670 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:13:43,748 INFO L202 PluginConnector]: Adding new model pcatest0.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:13:43 BoogieIcfgContainer [2019-08-05 10:13:43,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:13:43,751 INFO L168 Benchmark]: Toolchain (without parser) took 39958.47 ms. Allocated memory was 138.9 MB in the beginning and 561.0 MB in the end (delta: 422.1 MB). Free memory was 108.5 MB in the beginning and 495.1 MB in the end (delta: -386.6 MB). Peak memory consumption was 477.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:43,752 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:13:43,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.99 ms. Allocated memory is still 138.9 MB. Free memory was 108.5 MB in the beginning and 106.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:43,757 INFO L168 Benchmark]: Boogie Preprocessor took 21.75 ms. Allocated memory is still 138.9 MB. Free memory was 106.7 MB in the beginning and 105.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:43,758 INFO L168 Benchmark]: RCFGBuilder took 335.66 ms. Allocated memory is still 138.9 MB. Free memory was 105.4 MB in the beginning and 96.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:43,759 INFO L168 Benchmark]: TraceAbstraction took 39558.52 ms. Allocated memory was 138.9 MB in the beginning and 561.0 MB in the end (delta: 422.1 MB). Free memory was 96.0 MB in the beginning and 495.1 MB in the end (delta: -399.1 MB). Peak memory consumption was 465.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:43,764 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.99 ms. Allocated memory is still 138.9 MB. Free memory was 108.5 MB in the beginning and 106.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.75 ms. Allocated memory is still 138.9 MB. Free memory was 106.7 MB in the beginning and 105.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.66 ms. Allocated memory is still 138.9 MB. Free memory was 105.4 MB in the beginning and 96.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39558.52 ms. Allocated memory was 138.9 MB in the beginning and 561.0 MB in the end (delta: 422.1 MB). Free memory was 96.0 MB in the beginning and 495.1 MB in the end (delta: -399.1 MB). Peak memory consumption was 465.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: assertion can be violated assertion can be violated We found a FailurePath: [L9] time := 0.0; [L10] power := 0.0; VAL [power=0.0, time=0.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=2.0, time=1.0] [L16] assert power < 100.0; VAL [delay=1.0, power=2.0, time=1.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=4.0, time=2.0] [L16] assert power < 100.0; VAL [delay=1.0, power=4.0, time=2.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=6.0, time=3.0] [L16] assert power < 100.0; VAL [delay=1.0, power=6.0, time=3.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=8.0, time=4.0] [L16] assert power < 100.0; VAL [delay=1.0, power=8.0, time=4.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=10.0, time=5.0] [L16] assert power < 100.0; VAL [delay=1.0, power=10.0, time=5.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=12.0, time=6.0] [L16] assert power < 100.0; VAL [delay=1.0, power=12.0, time=6.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=14.0, time=7.0] [L16] assert power < 100.0; VAL [delay=1.0, power=14.0, time=7.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=16.0, time=8.0] [L16] assert power < 100.0; VAL [delay=1.0, power=16.0, time=8.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=18.0, time=9.0] [L16] assert power < 100.0; VAL [delay=1.0, power=18.0, time=9.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=20.0, time=10.0] [L16] assert power < 100.0; VAL [delay=1.0, power=20.0, time=10.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=22.0, time=11.0] [L16] assert power < 100.0; VAL [delay=1.0, power=22.0, time=11.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=24.0, time=12.0] [L16] assert power < 100.0; VAL [delay=1.0, power=24.0, time=12.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=26.0, time=13.0] [L16] assert power < 100.0; VAL [delay=1.0, power=26.0, time=13.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=28.0, time=14.0] [L16] assert power < 100.0; VAL [delay=1.0, power=28.0, time=14.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=30.0, time=15.0] [L16] assert power < 100.0; VAL [delay=1.0, power=30.0, time=15.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=32.0, time=16.0] [L16] assert power < 100.0; VAL [delay=1.0, power=32.0, time=16.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=34.0, time=17.0] [L16] assert power < 100.0; VAL [delay=1.0, power=34.0, time=17.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=36.0, time=18.0] [L16] assert power < 100.0; VAL [delay=1.0, power=36.0, time=18.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=38.0, time=19.0] [L16] assert power < 100.0; VAL [delay=1.0, power=38.0, time=19.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=40.0, time=20.0] [L16] assert power < 100.0; VAL [delay=1.0, power=40.0, time=20.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=42.0, time=21.0] [L16] assert power < 100.0; VAL [delay=1.0, power=42.0, time=21.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=44.0, time=22.0] [L16] assert power < 100.0; VAL [delay=1.0, power=44.0, time=22.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=46.0, time=23.0] [L16] assert power < 100.0; VAL [delay=1.0, power=46.0, time=23.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=48.0, time=24.0] [L16] assert power < 100.0; VAL [delay=1.0, power=48.0, time=24.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=50.0, time=25.0] [L16] assert power < 100.0; VAL [delay=1.0, power=50.0, time=25.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=52.0, time=26.0] [L16] assert power < 100.0; VAL [delay=1.0, power=52.0, time=26.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=54.0, time=27.0] [L16] assert power < 100.0; VAL [delay=1.0, power=54.0, time=27.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=56.0, time=28.0] [L16] assert power < 100.0; VAL [delay=1.0, power=56.0, time=28.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=58.0, time=29.0] [L16] assert power < 100.0; VAL [delay=1.0, power=58.0, time=29.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=60.0, time=30.0] [L16] assert power < 100.0; VAL [delay=1.0, power=60.0, time=30.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=62.0, time=31.0] [L16] assert power < 100.0; VAL [delay=1.0, power=62.0, time=31.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=64.0, time=32.0] [L16] assert power < 100.0; VAL [delay=1.0, power=64.0, time=32.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=66.0, time=33.0] [L16] assert power < 100.0; VAL [delay=1.0, power=66.0, time=33.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=68.0, time=34.0] [L16] assert power < 100.0; VAL [delay=1.0, power=68.0, time=34.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=70.0, time=35.0] [L16] assert power < 100.0; VAL [delay=1.0, power=70.0, time=35.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=72.0, time=36.0] [L16] assert power < 100.0; VAL [delay=1.0, power=72.0, time=36.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=74.0, time=37.0] [L16] assert power < 100.0; VAL [delay=1.0, power=74.0, time=37.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=76.0, time=38.0] [L16] assert power < 100.0; VAL [delay=1.0, power=76.0, time=38.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=78.0, time=39.0] [L16] assert power < 100.0; VAL [delay=1.0, power=78.0, time=39.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=80.0, time=40.0] [L16] assert power < 100.0; VAL [delay=1.0, power=80.0, time=40.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=82.0, time=41.0] [L16] assert power < 100.0; VAL [delay=1.0, power=82.0, time=41.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=84.0, time=42.0] [L16] assert power < 100.0; VAL [delay=1.0, power=84.0, time=42.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=86.0, time=43.0] [L16] assert power < 100.0; VAL [delay=1.0, power=86.0, time=43.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=88.0, time=44.0] [L16] assert power < 100.0; VAL [delay=1.0, power=88.0, time=44.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=90.0, time=45.0] [L16] assert power < 100.0; VAL [delay=1.0, power=90.0, time=45.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=92.0, time=46.0] [L16] assert power < 100.0; VAL [delay=1.0, power=92.0, time=46.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=94.0, time=47.0] [L16] assert power < 100.0; VAL [delay=1.0, power=94.0, time=47.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=96.0, time=48.0] [L16] assert power < 100.0; VAL [delay=1.0, power=96.0, time=48.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=98.0, time=49.0] [L16] assert power < 100.0; VAL [delay=1.0, power=98.0, time=49.0] [L11] COND TRUE time < 50.0 [L12] havoc delay; [L13] assume delay >= 0.0 && delay <= 1.0; [L14] time := time + delay; [L15] power := power + delay * 2.0; VAL [delay=1.0, power=100.0, time=50.0] [L16] assert power < 100.0; VAL [delay=1.0, power=100.0, time=50.0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 39.4s OverallTime, 50 OverallIterations, 50 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 1228 SDslu, 2 SDs, 0 SdLazy, 2874 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2450 GetRequests, 1176 SyntacticMatches, 0 SemanticMatches, 1274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 49 MinimizatonAttempts, 49 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 2600 NumberOfCodeBlocks, 2600 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2450 ConstructedInterpolants, 0 QuantifiedInterpolants, 803600 SizeOfPredicates, 1225 NumberOfNonLiveVariables, 10094 ConjunctsInSsa, 2548 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 0/39200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...