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/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:47:51,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:47:51,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:47:51,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:47:51,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:47:51,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:47:51,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:47:51,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:47:51,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:47:51,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:47:51,949 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:47:51,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:47:51,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:47:51,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:47:51,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:47:51,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:47:51,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:47:51,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:47:51,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:47:51,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:47:51,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:47:51,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:47:51,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:47:51,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:47:51,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:47:51,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:47:51,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:47:51,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:47:51,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:47:51,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:47:51,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:47:51,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:47:51,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:47:51,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:47:51,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:47:51,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:47:51,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:47:51,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:47:51,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:47:51,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:47:51,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:47:52,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:47:52,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:47:52,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:47:52,041 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:47:52,041 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:47:52,042 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl [2019-08-05 10:47:52,042 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl' [2019-08-05 10:47:52,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:47:52,073 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:47:52,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:52,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:47:52,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:47:52,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:52,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:47:52,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:47:52,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:47:52,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/1) ... [2019-08-05 10:47:52,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:47:52,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:47:52,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:47:52,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:47:52,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (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:47:52,202 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:47:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:47:52,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:47:52,573 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:47:52,574 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:47:52,575 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:52 BoogieIcfgContainer [2019-08-05 10:47:52,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:47:52,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:47:52,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:47:52,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:47:52,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:52" (1/2) ... [2019-08-05 10:47:52,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145e0941 and model type down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:47:52, skipping insertion in model container [2019-08-05 10:47:52,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:52" (2/2) ... [2019-08-05 10:47:52,586 INFO L109 eAbstractionObserver]: Analyzing ICFG down.i_4.bplTransformedIcfg_BEv2_5.bpl [2019-08-05 10:47:52,595 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:47:52,603 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:47:52,619 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:47:52,647 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:47:52,647 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:47:52,648 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:47:52,648 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:47:52,648 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:47:52,648 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:47:52,648 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:47:52,649 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:47:52,649 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:47:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:47:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:47:52,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:52,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:47:52,673 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:52,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:52,679 INFO L82 PathProgramCache]: Analyzing trace with hash 28868155, now seen corresponding path program 1 times [2019-08-05 10:47:52,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:52,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:47:52,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:52,919 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:47:52,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:47:52,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:47:52,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:47:52,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:47:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:47:52,968 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-08-05 10:47:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:53,064 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:47:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:47:53,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:47:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:53,078 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:47:53,078 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:47:53,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:47:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:47:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:47:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:47:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:47:53,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:47:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:53,107 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:47:53,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:47:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:47:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:47:53,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:53,109 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:47:53,109 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:53,110 INFO L82 PathProgramCache]: Analyzing trace with hash 892360290, now seen corresponding path program 1 times [2019-08-05 10:47:53,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:53,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:47:53,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:47:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:53,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:47:53,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:47:53,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:47:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:47:53,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:47:53,203 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-05 10:47:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:53,310 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:47:53,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:47:53,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:47:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:53,311 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:47:53,312 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:47:53,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:47:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:47:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2019-08-05 10:47:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:47:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:47:53,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:47:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:53,316 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:47:53,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:47:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:47:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:47:53,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:53,318 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:47:53,318 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1435154486, now seen corresponding path program 1 times [2019-08-05 10:47:53,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:53,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:47:53,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:53,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:53,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:47:53,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:47:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:47:53,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:47:53,461 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-05 10:47:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:53,737 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:47:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:47:53,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:47:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:53,739 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:47:53,739 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:47:53,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:47:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:47:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:47:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:47:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:47:53,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-05 10:47:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:53,743 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:47:53,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:47:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:47:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:47:53,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:53,744 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:47:53,744 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:53,745 INFO L82 PathProgramCache]: Analyzing trace with hash 299903555, now seen corresponding path program 2 times [2019-08-05 10:47:53,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:53,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:47:53,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:47:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:53,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:53,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:47:53,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:47:53,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:47:53,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:47:53,870 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2019-08-05 10:47:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:54,099 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 10:47:54,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:47:54,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:47:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:54,100 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:47:54,100 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:47:54,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:47:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:47:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2019-08-05 10:47:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:47:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 10:47:54,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2019-08-05 10:47:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:54,105 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 10:47:54,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:47:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 10:47:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:47:54,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:54,106 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:47:54,106 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 444573547, now seen corresponding path program 3 times [2019-08-05 10:47:54,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:54,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:47:54,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:54,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:54,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:47:54,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:47:54,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:47:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:47:54,249 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2019-08-05 10:47:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:54,370 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 10:47:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:47:54,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 10:47:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:54,371 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:47:54,372 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:47:54,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:47:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:47:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:47:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:47:54,375 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-08-05 10:47:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:54,375 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:47:54,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:47:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:47:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:47:54,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:54,376 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2019-08-05 10:47:54,377 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash -372734382, now seen corresponding path program 4 times [2019-08-05 10:47:54,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:54,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:47:54,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:54,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:47:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:54,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:54,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:47:54,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:47:54,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:47:54,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:47:54,525 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 10:47:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:54,933 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:47:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:47:54,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:47:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:54,936 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:47:54,936 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:47:54,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:47:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-08-05 10:47:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:47:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:47:54,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 10:47:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:54,940 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:47:54,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:47:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:47:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:47:54,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:54,941 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2019-08-05 10:47:54,941 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1715389510, now seen corresponding path program 5 times [2019-08-05 10:47:54,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:54,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:47:54,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:55,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:55,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:47:55,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:47:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:47:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:47:55,150 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2019-08-05 10:47:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:55,290 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:47:55,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:47:55,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 10:47:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:55,291 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:47:55,291 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:47:55,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:47:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:47:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:47:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:47:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 10:47:55,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-05 10:47:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:55,295 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 10:47:55,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:47:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 10:47:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:47:55,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:55,296 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2019-08-05 10:47:55,296 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1966301325, now seen corresponding path program 6 times [2019-08-05 10:47:55,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:55,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:47:55,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:55,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:47:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:55,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:55,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:47:55,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:47:55,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:47:55,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:47:55,443 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2019-08-05 10:47:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:55,563 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 10:47:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:47:55,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 10:47:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:55,565 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:47:55,565 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:47:55,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:47:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:47:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-08-05 10:47:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:47:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 10:47:55,569 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-08-05 10:47:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:55,570 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 10:47:55,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:47:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 10:47:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:47:55,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:55,571 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2019-08-05 10:47:55,571 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:55,571 INFO L82 PathProgramCache]: Analyzing trace with hash 170102939, now seen corresponding path program 7 times [2019-08-05 10:47:55,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:55,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:47:55,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:55,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:55,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:47:55,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:47:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:47:55,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:47:55,811 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2019-08-05 10:47:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:56,012 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 10:47:56,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:47:56,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-08-05 10:47:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:56,014 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:47:56,015 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:47:56,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:47:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:47:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:47:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:47:56,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2019-08-05 10:47:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:56,018 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:47:56,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:47:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:47:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:47:56,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:56,019 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2019-08-05 10:47:56,019 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1500682686, now seen corresponding path program 8 times [2019-08-05 10:47:56,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:56,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:47:56,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:56,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:47:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:56,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:56,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:47:56,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:47:56,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:47:56,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:47:56,198 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2019-08-05 10:47:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:56,313 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 10:47:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:47:56,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:47:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:56,319 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:47:56,319 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:47:56,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:47:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-08-05 10:47:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:47:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 10:47:56,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-05 10:47:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:56,323 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 10:47:56,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:47:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 10:47:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:47:56,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:56,324 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2019-08-05 10:47:56,324 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 953016234, now seen corresponding path program 9 times [2019-08-05 10:47:56,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:56,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:47:56,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:56,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:56,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:47:56,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:47:56,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:47:56,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:47:56,506 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 14 states. [2019-08-05 10:47:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:56,640 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 10:47:56,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:47:56,641 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-08-05 10:47:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:56,641 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:47:56,642 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:47:56,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:47:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:47:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:47:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:47:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 10:47:56,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2019-08-05 10:47:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:56,646 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 10:47:56,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:47:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 10:47:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:47:56,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:56,647 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2019-08-05 10:47:56,647 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash 954455203, now seen corresponding path program 10 times [2019-08-05 10:47:56,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:56,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:47:56,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:56,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:47:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:56,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:56,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:47:56,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:47:56,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:47:56,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:47:56,806 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 10 states. [2019-08-05 10:47:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,265 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 10:47:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:47:57,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-08-05 10:47:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,266 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:47:57,266 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:47:57,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:47:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-08-05 10:47:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:47:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 10:47:57,270 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2019-08-05 10:47:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,271 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 10:47:57,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:47:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 10:47:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:47:57,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,272 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2019-08-05 10:47:57,273 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1891485237, now seen corresponding path program 11 times [2019-08-05 10:47:57,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:57,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:57,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:47:57,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:47:57,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:47:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:47:57,478 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 16 states. [2019-08-05 10:47:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,645 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 10:47:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:47:57,645 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-08-05 10:47:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,646 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:47:57,646 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:47:57,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:47:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:47:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:47:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:47:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 10:47:57,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-08-05 10:47:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,652 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 10:47:57,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:47:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 10:47:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:47:57,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,654 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2019-08-05 10:47:57,654 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1972832718, now seen corresponding path program 12 times [2019-08-05 10:47:57,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:57,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:47:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:57,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:57,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:47:57,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:47:57,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:47:57,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:57,782 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2019-08-05 10:47:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,935 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 10:47:57,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:47:57,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-08-05 10:47:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,937 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:47:57,937 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:47:57,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:47:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:47:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-08-05 10:47:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:47:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 10:47:57,941 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-05 10:47:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,941 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 10:47:57,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:47:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 10:47:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:57,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,942 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2019-08-05 10:47:57,943 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1811598438, now seen corresponding path program 13 times [2019-08-05 10:47:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:58,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:58,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:47:58,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:47:58,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:47:58,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:47:58,173 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2019-08-05 10:47:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:58,488 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:47:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:47:58,489 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-08-05 10:47:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:58,489 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:47:58,490 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:47:58,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:47:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:47:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:47:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 10:47:58,493 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-08-05 10:47:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:58,494 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 10:47:58,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:47:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 10:47:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:58,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:58,495 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2019-08-05 10:47:58,495 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1422117331, now seen corresponding path program 14 times [2019-08-05 10:47:58,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:58,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:47:58,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:58,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:47:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:58,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:58,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:47:58,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:47:58,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:47:58,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:47:58,689 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-08-05 10:47:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:59,002 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 10:47:59,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:47:59,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-08-05 10:47:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:59,003 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:47:59,003 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:47:59,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:47:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:47:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-08-05 10:47:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:47:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 10:47:59,008 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-08-05 10:47:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:59,008 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 10:47:59,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:47:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 10:47:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:47:59,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:59,010 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2019-08-05 10:47:59,010 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:59,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:59,010 INFO L82 PathProgramCache]: Analyzing trace with hash 855220987, now seen corresponding path program 15 times [2019-08-05 10:47:59,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:59,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:47:59,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:59,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:59,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:47:59,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:47:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:47:59,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:47:59,706 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 20 states. [2019-08-05 10:47:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:59,882 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-08-05 10:47:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:47:59,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-08-05 10:47:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:59,884 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:47:59,884 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:47:59,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:47:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:47:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:47:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:47:59,887 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2019-08-05 10:47:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:59,888 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:47:59,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:47:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:47:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:47:59,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:59,889 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2019-08-05 10:47:59,889 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash 365245986, now seen corresponding path program 16 times [2019-08-05 10:47:59,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:59,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:47:59,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:00,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:00,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:00,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:48:00,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:48:00,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:48:00,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:48:00,031 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2019-08-05 10:48:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:00,319 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 10:48:00,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:48:00,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-08-05 10:48:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:00,320 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:48:00,320 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:48:00,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:48:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:48:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-08-05 10:48:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:48:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 10:48:00,325 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-08-05 10:48:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:00,325 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 10:48:00,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:48:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 10:48:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:48:00,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:00,326 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2019-08-05 10:48:00,327 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:00,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1185859702, now seen corresponding path program 17 times [2019-08-05 10:48:00,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:00,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:48:00,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:00,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:00,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:48:00,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:48:00,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:48:00,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:48:00,680 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2019-08-05 10:48:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:00,967 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 10:48:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:48:00,967 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-08-05 10:48:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:00,968 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:48:00,968 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:48:00,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:48:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:48:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:48:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 10:48:00,972 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2019-08-05 10:48:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:00,972 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 10:48:00,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:48:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 10:48:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:48:00,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:00,973 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2019-08-05 10:48:00,974 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:00,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 562724611, now seen corresponding path program 18 times [2019-08-05 10:48:00,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:00,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:48:00,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:01,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:01,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:01,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:48:01,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:48:01,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:48:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:48:01,399 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 14 states. [2019-08-05 10:48:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:01,590 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-05 10:48:01,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:48:01,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-08-05 10:48:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:01,591 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:48:01,591 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:48:01,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:48:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:48:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-08-05 10:48:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:48:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 10:48:01,595 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2019-08-05 10:48:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:01,595 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 10:48:01,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:48:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 10:48:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:48:01,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:01,596 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2019-08-05 10:48:01,597 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash -387462101, now seen corresponding path program 19 times [2019-08-05 10:48:01,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:01,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:48:01,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:02,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:02,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:48:02,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:48:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:48:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:48:02,071 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 24 states. [2019-08-05 10:48:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:02,329 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 10:48:02,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:48:02,329 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-08-05 10:48:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:02,330 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:48:02,330 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:48:02,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:48:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:48:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:48:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 10:48:02,334 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-08-05 10:48:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:02,334 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 10:48:02,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:48:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 10:48:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:48:02,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:02,335 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2019-08-05 10:48:02,335 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:02,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1970526702, now seen corresponding path program 20 times [2019-08-05 10:48:02,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:02,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:48:02,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:02,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:02,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:02,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:48:02,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:48:02,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:48:02,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:48:02,628 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 15 states. [2019-08-05 10:48:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:03,258 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 10:48:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:48:03,260 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-08-05 10:48:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:03,261 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:48:03,261 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:48:03,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:48:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-08-05 10:48:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:48:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:48:03,265 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-08-05 10:48:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:03,266 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:48:03,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:48:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:48:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:48:03,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:03,267 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2019-08-05 10:48:03,267 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 404482938, now seen corresponding path program 21 times [2019-08-05 10:48:03,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:03,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:48:03,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:04,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:04,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:04,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:48:04,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:48:04,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:48:04,349 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2019-08-05 10:48:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:04,861 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-05 10:48:04,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:48:04,861 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-08-05 10:48:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:04,862 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:48:04,862 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:48:04,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:48:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:48:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:48:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-05 10:48:04,866 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-08-05 10:48:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:04,875 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-05 10:48:04,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:48:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-05 10:48:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:48:04,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:04,876 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2019-08-05 10:48:04,877 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:04,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1932135373, now seen corresponding path program 22 times [2019-08-05 10:48:04,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:04,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:48:04,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:05,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:05,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:05,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:48:05,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:48:05,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:48:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:48:05,069 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 16 states. [2019-08-05 10:48:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:05,314 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-05 10:48:05,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:48:05,315 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-08-05 10:48:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:05,316 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:48:05,316 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:48:05,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:48:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:48:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-08-05 10:48:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:48:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-05 10:48:05,320 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2019-08-05 10:48:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:05,321 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-05 10:48:05,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:48:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-05 10:48:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:48:05,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:05,322 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2019-08-05 10:48:05,322 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:05,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1356155557, now seen corresponding path program 23 times [2019-08-05 10:48:05,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:05,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:48:05,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:05,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:05,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:48:05,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:48:05,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:48:05,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:05,735 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2019-08-05 10:48:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:06,170 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-08-05 10:48:06,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:48:06,171 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2019-08-05 10:48:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:06,172 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:48:06,172 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:48:06,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:48:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:48:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:48:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 10:48:06,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2019-08-05 10:48:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:06,176 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 10:48:06,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:48:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 10:48:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:48:06,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:06,177 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2019-08-05 10:48:06,177 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1277675010, now seen corresponding path program 24 times [2019-08-05 10:48:06,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:06,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:48:06,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:06,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:06,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:06,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:48:06,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:48:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:48:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:48:06,520 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 17 states. [2019-08-05 10:48:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:06,752 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 10:48:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:48:06,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-08-05 10:48:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:06,753 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:48:06,753 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:48:06,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:48:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-08-05 10:48:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:48:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 10:48:06,756 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-05 10:48:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:06,757 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 10:48:06,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:48:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 10:48:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:48:06,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:06,758 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2019-08-05 10:48:06,758 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:06,758 INFO L82 PathProgramCache]: Analyzing trace with hash -514896022, now seen corresponding path program 25 times [2019-08-05 10:48:06,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:06,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:48:06,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:07,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:07,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:48:07,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:48:07,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:48:07,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:07,407 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 30 states. [2019-08-05 10:48:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:07,872 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 10:48:07,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:48:07,872 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-08-05 10:48:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:07,873 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:48:07,873 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:48:07,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:48:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:48:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:48:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-05 10:48:07,876 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2019-08-05 10:48:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:07,876 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-05 10:48:07,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:48:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-05 10:48:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:48:07,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:07,877 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2019-08-05 10:48:07,877 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash -826005149, now seen corresponding path program 26 times [2019-08-05 10:48:07,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:07,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:48:07,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:08,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:08,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:08,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:48:08,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:48:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:48:08,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:48:08,115 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2019-08-05 10:48:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:08,709 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-05 10:48:08,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:48:08,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-08-05 10:48:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:08,716 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:48:08,716 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:48:08,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:48:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2019-08-05 10:48:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:48:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-05 10:48:08,719 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2019-08-05 10:48:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:08,719 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-05 10:48:08,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:48:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-05 10:48:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:48:08,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:08,720 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2019-08-05 10:48:08,720 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:08,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 778067595, now seen corresponding path program 27 times [2019-08-05 10:48:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:08,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:48:08,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:09,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:09,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:48:09,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:48:09,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:48:09,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:09,076 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 32 states. [2019-08-05 10:48:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:10,084 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-08-05 10:48:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:48:10,084 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-08-05 10:48:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:10,085 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:48:10,085 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:48:10,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:48:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:48:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:48:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 10:48:10,089 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-08-05 10:48:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:10,089 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 10:48:10,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:48:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 10:48:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:48:10,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:10,090 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2019-08-05 10:48:10,090 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1065489906, now seen corresponding path program 28 times [2019-08-05 10:48:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:10,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:48:10,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:10,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:10,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:10,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:48:10,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:48:10,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:48:10,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:48:10,540 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2019-08-05 10:48:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:10,803 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 10:48:10,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:48:10,804 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-08-05 10:48:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:10,805 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:48:10,805 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:48:10,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:48:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-08-05 10:48:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:48:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 10:48:10,809 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-05 10:48:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:10,809 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 10:48:10,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:48:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 10:48:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:48:10,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:10,810 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2019-08-05 10:48:10,810 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1733649242, now seen corresponding path program 29 times [2019-08-05 10:48:10,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:10,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:48:10,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:11,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:11,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:48:11,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:48:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:48:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:11,592 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 34 states. [2019-08-05 10:48:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:12,563 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-05 10:48:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:48:12,564 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 50 [2019-08-05 10:48:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:12,565 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:48:12,565 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:48:12,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:48:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:48:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-05 10:48:12,567 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-08-05 10:48:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:12,567 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-05 10:48:12,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:48:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-05 10:48:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:48:12,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:12,568 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2019-08-05 10:48:12,568 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash 166928019, now seen corresponding path program 30 times [2019-08-05 10:48:12,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:12,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:48:12,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:12,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:12,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:12,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:48:12,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:48:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:48:12,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:48:12,940 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 20 states. [2019-08-05 10:48:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:13,302 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 10:48:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:48:13,303 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-08-05 10:48:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:13,304 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:48:13,304 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:48:13,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:48:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:48:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-08-05 10:48:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:48:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-05 10:48:13,308 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2019-08-05 10:48:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:13,308 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-05 10:48:13,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:48:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-05 10:48:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:48:13,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:13,309 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2019-08-05 10:48:13,309 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1504102331, now seen corresponding path program 31 times [2019-08-05 10:48:13,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:13,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:48:13,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:13,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:13,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:48:13,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:48:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:48:13,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:13,799 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 36 states. [2019-08-05 10:48:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:14,196 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-05 10:48:14,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:48:14,196 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2019-08-05 10:48:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:14,197 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:48:14,197 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:48:14,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:48:14,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:48:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:48:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:48:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 10:48:14,200 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2019-08-05 10:48:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:14,200 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 10:48:14,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:48:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 10:48:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:48:14,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:14,201 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2019-08-05 10:48:14,201 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash 721753570, now seen corresponding path program 32 times [2019-08-05 10:48:14,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:14,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:48:14,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:14,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:14,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:14,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:48:14,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:48:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:48:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:48:14,448 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 21 states. [2019-08-05 10:48:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:15,035 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 10:48:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:48:15,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-08-05 10:48:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:15,036 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:48:15,036 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:48:15,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:48:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:48:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-08-05 10:48:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:48:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 10:48:15,038 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-08-05 10:48:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:15,039 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 10:48:15,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:48:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 10:48:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:48:15,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:15,039 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2019-08-05 10:48:15,039 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:15,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:15,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2115512138, now seen corresponding path program 33 times [2019-08-05 10:48:15,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:15,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:48:15,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:15,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:15,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:48:15,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:48:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:48:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:15,744 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 38 states. [2019-08-05 10:48:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:16,276 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-05 10:48:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:48:16,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2019-08-05 10:48:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:16,278 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:48:16,278 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:48:16,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:48:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:48:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:48:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:48:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 10:48:16,281 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2019-08-05 10:48:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:16,282 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 10:48:16,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:48:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 10:48:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:48:16,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:16,282 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2019-08-05 10:48:16,283 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:16,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:16,283 INFO L82 PathProgramCache]: Analyzing trace with hash -343878717, now seen corresponding path program 34 times [2019-08-05 10:48:16,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:16,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:48:16,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:16,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:16,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:16,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:48:16,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:48:16,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:48:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:48:16,541 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 22 states. [2019-08-05 10:48:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:16,871 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-05 10:48:16,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:48:16,871 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-08-05 10:48:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:16,872 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:48:16,872 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:48:16,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:48:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-08-05 10:48:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:48:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-08-05 10:48:16,876 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-08-05 10:48:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:16,876 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-08-05 10:48:16,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:48:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-08-05 10:48:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:48:16,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:16,877 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2019-08-05 10:48:16,877 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:16,877 INFO L82 PathProgramCache]: Analyzing trace with hash 245100779, now seen corresponding path program 35 times [2019-08-05 10:48:16,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:16,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:48:16,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:17,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:17,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:48:17,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:48:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:48:17,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:17,500 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 40 states. [2019-08-05 10:48:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:18,469 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-08-05 10:48:18,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:48:18,469 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2019-08-05 10:48:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:18,470 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:48:18,471 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:48:18,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:48:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:48:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:48:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:48:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 10:48:18,474 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-08-05 10:48:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:18,474 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 10:48:18,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:48:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 10:48:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:48:18,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:18,475 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2019-08-05 10:48:18,475 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash 379241938, now seen corresponding path program 36 times [2019-08-05 10:48:18,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:18,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:48:18,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:18,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:19,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:19,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:48:19,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:48:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:48:19,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:48:19,008 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 23 states. [2019-08-05 10:48:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:19,475 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 10:48:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:48:19,475 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2019-08-05 10:48:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:19,476 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:48:19,476 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:48:19,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:48:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:48:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-08-05 10:48:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:48:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 10:48:19,480 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-08-05 10:48:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:19,481 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 10:48:19,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:48:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 10:48:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:48:19,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:19,482 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2019-08-05 10:48:19,482 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -620651718, now seen corresponding path program 37 times [2019-08-05 10:48:19,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:19,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:48:19,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:20,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:20,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:48:20,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:48:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:48:20,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:20,409 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 42 states. [2019-08-05 10:48:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:20,937 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 10:48:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:48:20,938 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2019-08-05 10:48:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:20,939 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:48:20,939 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:48:20,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:48:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:48:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:48:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:48:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-08-05 10:48:20,942 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-08-05 10:48:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:20,942 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-08-05 10:48:20,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:48:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-08-05 10:48:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:48:20,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:20,943 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2019-08-05 10:48:20,944 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1259030771, now seen corresponding path program 38 times [2019-08-05 10:48:20,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:20,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:48:20,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:21,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:48:21,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:48:21,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:48:21,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:48:21,287 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 24 states. [2019-08-05 10:48:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,755 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-08-05 10:48:21,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:48:21,755 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2019-08-05 10:48:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,756 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:48:21,757 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:48:21,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:48:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:48:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-08-05 10:48:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:48:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-05 10:48:21,761 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2019-08-05 10:48:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,761 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-05 10:48:21,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:48:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-05 10:48:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:48:21,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,762 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2019-08-05 10:48:21,762 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1252140517, now seen corresponding path program 39 times [2019-08-05 10:48:21,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:23,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:23,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:48:23,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:48:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:48:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:23,069 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 44 states. [2019-08-05 10:48:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:23,935 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-08-05 10:48:23,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:48:23,935 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2019-08-05 10:48:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:23,936 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:48:23,936 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:48:23,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:48:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:48:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:48:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:48:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-05 10:48:23,939 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2019-08-05 10:48:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:23,939 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-05 10:48:23,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:48:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-05 10:48:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:48:23,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:23,940 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2019-08-05 10:48:23,940 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:23,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:23,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1414715966, now seen corresponding path program 40 times [2019-08-05 10:48:23,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:23,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:48:23,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:24,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:24,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:24,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:48:24,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:48:24,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:48:24,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:48:24,269 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 25 states. [2019-08-05 10:48:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:24,686 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 10:48:24,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:48:24,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2019-08-05 10:48:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:24,687 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:48:24,687 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:48:24,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:48:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-08-05 10:48:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:48:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-05 10:48:24,691 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-05 10:48:24,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:24,691 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-05 10:48:24,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:48:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-05 10:48:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:48:24,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:24,692 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2019-08-05 10:48:24,692 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1962655530, now seen corresponding path program 41 times [2019-08-05 10:48:24,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:24,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:48:24,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:25,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:25,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:48:25,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:48:25,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:48:25,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:48:25,699 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 46 states. [2019-08-05 10:48:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,439 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-05 10:48:26,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:48:26,440 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2019-08-05 10:48:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,441 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:48:26,441 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:48:26,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:48:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:48:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:48:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:48:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-08-05 10:48:26,444 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2019-08-05 10:48:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,444 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-08-05 10:48:26,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:48:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-08-05 10:48:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:48:26,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,445 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2019-08-05 10:48:26,445 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash -894403037, now seen corresponding path program 42 times [2019-08-05 10:48:26,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:26,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:26,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:26,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:26,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:48:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:48:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:48:26,789 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2019-08-05 10:48:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:27,282 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-08-05 10:48:27,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:48:27,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-08-05 10:48:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:27,283 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:27,283 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:48:27,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:48:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:48:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-08-05 10:48:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:48:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-08-05 10:48:27,287 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-08-05 10:48:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:27,287 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-08-05 10:48:27,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:48:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-08-05 10:48:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:48:27,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:27,288 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2019-08-05 10:48:27,288 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:27,288 INFO L82 PathProgramCache]: Analyzing trace with hash -527793333, now seen corresponding path program 43 times [2019-08-05 10:48:27,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:27,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:48:27,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:28,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:48:28,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:48:28,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:48:28,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:48:28,153 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 48 states. [2019-08-05 10:48:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:28,943 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-08-05 10:48:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:48:28,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2019-08-05 10:48:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:28,945 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:48:28,945 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:48:28,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:48:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:48:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:48:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:48:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-05 10:48:28,948 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-08-05 10:48:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:28,948 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-05 10:48:28,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:48:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-05 10:48:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:48:28,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:28,949 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2019-08-05 10:48:28,949 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1792657998, now seen corresponding path program 44 times [2019-08-05 10:48:28,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:28,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:48:28,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:29,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:29,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:29,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:48:29,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:29,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:29,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:29,333 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 27 states. [2019-08-05 10:48:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:29,789 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 10:48:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:48:29,790 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-08-05 10:48:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:29,791 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:48:29,791 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:48:29,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:48:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:48:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-08-05 10:48:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:48:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-05 10:48:29,794 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-05 10:48:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:29,794 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-05 10:48:29,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-05 10:48:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:48:29,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:29,795 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2019-08-05 10:48:29,795 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash -462384358, now seen corresponding path program 45 times [2019-08-05 10:48:29,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:29,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:48:29,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:30,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:30,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:48:30,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:48:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:48:30,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:30,932 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 50 states. [2019-08-05 10:48:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,647 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-05 10:48:31,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:48:31,647 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2019-08-05 10:48:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,648 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:48:31,648 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:48:31,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:48:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:48:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:48:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:48:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-08-05 10:48:31,651 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-08-05 10:48:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,652 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-08-05 10:48:31,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:48:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-08-05 10:48:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:48:31,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,652 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2019-08-05 10:48:31,653 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1997435731, now seen corresponding path program 46 times [2019-08-05 10:48:31,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:31,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:31,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:31,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:48:31,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:48:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:48:31,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:31,988 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 28 states. [2019-08-05 10:48:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:32,481 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-05 10:48:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:48:32,482 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-08-05 10:48:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:32,483 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:48:32,483 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:48:32,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:48:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:48:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-08-05 10:48:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:48:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-08-05 10:48:32,487 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-08-05 10:48:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:32,487 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-08-05 10:48:32,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:48:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-08-05 10:48:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:48:32,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:32,487 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2019-08-05 10:48:32,488 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:32,488 INFO L82 PathProgramCache]: Analyzing trace with hash -314577797, now seen corresponding path program 47 times [2019-08-05 10:48:32,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:32,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:48:32,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:33,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:33,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:48:33,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:48:33,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:48:33,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:48:33,901 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 52 states. [2019-08-05 10:48:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:35,446 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-08-05 10:48:35,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:48:35,447 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 77 [2019-08-05 10:48:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:35,447 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:48:35,447 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:48:35,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:48:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:48:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:48:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:48:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-05 10:48:35,450 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2019-08-05 10:48:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:35,450 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-05 10:48:35,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:48:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-05 10:48:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:48:35,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:35,451 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2019-08-05 10:48:35,451 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash -546310750, now seen corresponding path program 48 times [2019-08-05 10:48:35,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:35,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:48:35,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:35,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:35,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:35,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:48:35,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:48:35,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:48:35,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:48:35,847 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 29 states. [2019-08-05 10:48:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:36,577 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 10:48:36,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:48:36,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-08-05 10:48:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:36,579 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:48:36,579 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:48:36,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:48:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:48:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-08-05 10:48:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:48:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-05 10:48:36,583 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-08-05 10:48:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:36,583 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-05 10:48:36,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:48:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-05 10:48:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:48:36,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:36,584 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2019-08-05 10:48:36,584 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1018554614, now seen corresponding path program 49 times [2019-08-05 10:48:36,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:36,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:48:36,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:37,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:37,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:48:37,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:48:37,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:48:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:48:37,457 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 54 states. [2019-08-05 10:48:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:38,859 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-05 10:48:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:48:38,859 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 80 [2019-08-05 10:48:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:38,861 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:48:38,861 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:48:38,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:48:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:48:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:48:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:48:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-08-05 10:48:38,863 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2019-08-05 10:48:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:38,863 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-08-05 10:48:38,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:48:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-08-05 10:48:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:48:38,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:38,864 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2019-08-05 10:48:38,865 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:38,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1732454531, now seen corresponding path program 50 times [2019-08-05 10:48:38,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:38,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:48:38,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:39,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:39,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:39,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:48:39,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:48:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:48:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:39,252 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 30 states. [2019-08-05 10:48:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:39,806 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-05 10:48:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:48:39,807 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 81 [2019-08-05 10:48:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:39,808 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:48:39,808 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:48:39,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:48:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:48:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-08-05 10:48:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:48:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-08-05 10:48:39,811 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2019-08-05 10:48:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:39,812 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-08-05 10:48:39,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:48:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-08-05 10:48:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:48:39,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:39,813 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2019-08-05 10:48:39,813 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1558440533, now seen corresponding path program 51 times [2019-08-05 10:48:39,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:39,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:48:39,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:41,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:41,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:48:41,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:48:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:48:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:48:41,166 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 56 states. [2019-08-05 10:48:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:42,741 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2019-08-05 10:48:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:48:42,741 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 83 [2019-08-05 10:48:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:42,742 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:48:42,742 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:48:42,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:48:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:48:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:48:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:48:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-05 10:48:42,745 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-08-05 10:48:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:42,745 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-05 10:48:42,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:48:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-05 10:48:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:48:42,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:42,746 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2019-08-05 10:48:42,746 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1484023186, now seen corresponding path program 52 times [2019-08-05 10:48:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:42,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:48:42,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:43,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:43,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:43,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:48:43,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:48:43,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:48:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:43,238 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 31 states. [2019-08-05 10:48:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:43,955 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 10:48:43,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:48:43,956 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2019-08-05 10:48:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:43,957 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:48:43,957 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:48:43,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:48:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:48:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-08-05 10:48:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:48:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-05 10:48:43,961 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-08-05 10:48:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:43,961 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-05 10:48:43,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:48:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-05 10:48:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:48:43,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:43,962 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2019-08-05 10:48:43,962 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash 217205498, now seen corresponding path program 53 times [2019-08-05 10:48:43,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:43,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:48:43,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:45,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:45,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:48:45,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:48:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:48:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:48:45,046 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 58 states. [2019-08-05 10:48:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:46,703 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-05 10:48:46,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:48:46,703 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 86 [2019-08-05 10:48:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:46,704 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:48:46,704 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:48:46,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:48:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:48:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:48:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:48:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-08-05 10:48:46,706 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-08-05 10:48:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:46,706 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-08-05 10:48:46,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:48:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-08-05 10:48:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:48:46,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:46,707 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2019-08-05 10:48:46,708 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1559010739, now seen corresponding path program 54 times [2019-08-05 10:48:46,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:46,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:48:46,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:47,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:47,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:47,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:48:47,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:48:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:48:47,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:47,257 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 32 states. [2019-08-05 10:48:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:47,835 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-08-05 10:48:47,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:48:47,836 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 87 [2019-08-05 10:48:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:47,837 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:48:47,837 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:48:47,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:48:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:48:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-08-05 10:48:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:48:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-08-05 10:48:47,841 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2019-08-05 10:48:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:47,841 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-08-05 10:48:47,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:48:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-08-05 10:48:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:48:47,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:47,842 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2019-08-05 10:48:47,842 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash -734200101, now seen corresponding path program 55 times [2019-08-05 10:48:47,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:47,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:48:47,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:48,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:48,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:48:48,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:48:48,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:48:48,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:48:48,872 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 60 states. [2019-08-05 10:48:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:50,170 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-08-05 10:48:50,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:48:50,170 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 89 [2019-08-05 10:48:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:50,172 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:48:50,172 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:48:50,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:48:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:48:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:48:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:48:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-05 10:48:50,174 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2019-08-05 10:48:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:50,175 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-05 10:48:50,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:48:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-05 10:48:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:48:50,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:50,176 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2019-08-05 10:48:50,176 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:50,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:50,176 INFO L82 PathProgramCache]: Analyzing trace with hash -274889342, now seen corresponding path program 56 times [2019-08-05 10:48:50,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:50,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:48:50,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:51,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:51,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:51,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:48:51,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:48:51,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:48:51,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:51,570 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 33 states. [2019-08-05 10:48:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:52,171 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-05 10:48:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:48:52,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 90 [2019-08-05 10:48:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:52,172 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:48:52,173 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:48:52,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:48:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:48:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-08-05 10:48:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:48:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-05 10:48:52,176 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-05 10:48:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:52,177 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-05 10:48:52,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:48:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-05 10:48:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:48:52,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:52,177 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2019-08-05 10:48:52,178 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2119380714, now seen corresponding path program 57 times [2019-08-05 10:48:52,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:52,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:48:52,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:53,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:53,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:48:53,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:48:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:48:53,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:48:53,348 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 62 states. [2019-08-05 10:48:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:54,912 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2019-08-05 10:48:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:48:54,912 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 92 [2019-08-05 10:48:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:54,913 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:48:54,913 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:48:54,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:48:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:48:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:48:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:48:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-08-05 10:48:54,916 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2019-08-05 10:48:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:54,916 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-08-05 10:48:54,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:48:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-08-05 10:48:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:48:54,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:54,917 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2019-08-05 10:48:54,917 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1680397027, now seen corresponding path program 58 times [2019-08-05 10:48:54,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:54,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:48:54,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:55,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:48:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:55,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:55,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:48:55,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:48:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:48:55,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:55,504 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 34 states. [2019-08-05 10:48:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:56,315 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-08-05 10:48:56,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:48:56,316 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 93 [2019-08-05 10:48:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:56,317 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:48:56,317 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:48:56,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:48:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:48:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-08-05 10:48:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:48:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-08-05 10:48:56,320 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-08-05 10:48:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:56,320 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-08-05 10:48:56,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:48:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-08-05 10:48:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:48:56,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:56,321 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2019-08-05 10:48:56,321 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash -46094325, now seen corresponding path program 59 times [2019-08-05 10:48:56,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:56,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:48:56,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:58,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:58,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:48:58,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:48:58,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:48:58,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:48:58,208 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 64 states. [2019-08-05 10:48:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:59,191 INFO L93 Difference]: Finished difference Result 158 states and 159 transitions. [2019-08-05 10:48:59,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:48:59,192 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 95 [2019-08-05 10:48:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:59,193 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:48:59,193 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:48:59,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:48:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:48:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:48:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:48:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-05 10:48:59,196 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-08-05 10:48:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:59,196 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-05 10:48:59,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:48:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-05 10:48:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:48:59,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:59,197 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2019-08-05 10:48:59,197 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash 366302578, now seen corresponding path program 60 times [2019-08-05 10:48:59,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:59,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:48:59,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:00,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:00,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:00,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:49:00,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:49:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:49:00,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:49:00,048 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 35 states. [2019-08-05 10:49:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:00,804 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 10:49:00,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:49:00,805 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 96 [2019-08-05 10:49:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:00,806 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:49:00,806 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:49:00,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:49:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:49:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-08-05 10:49:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:49:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-05 10:49:00,808 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-05 10:49:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:00,809 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-05 10:49:00,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:49:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-05 10:49:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:49:00,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:00,810 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2019-08-05 10:49:00,810 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:00,810 INFO L82 PathProgramCache]: Analyzing trace with hash -170474790, now seen corresponding path program 61 times [2019-08-05 10:49:00,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:00,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:49:00,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:02,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:02,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:49:02,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:49:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:49:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:49:02,378 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 66 states. [2019-08-05 10:49:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:04,432 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-05 10:49:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:49:04,433 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 98 [2019-08-05 10:49:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:04,434 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:49:04,434 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:49:04,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:49:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:49:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:49:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:49:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-08-05 10:49:04,436 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-08-05 10:49:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:04,437 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-08-05 10:49:04,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:49:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-08-05 10:49:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:49:04,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:04,437 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2019-08-05 10:49:04,437 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1939195923, now seen corresponding path program 62 times [2019-08-05 10:49:04,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:04,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:49:04,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:04,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:04,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:04,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:49:04,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:49:04,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:49:04,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:49:04,964 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 36 states. [2019-08-05 10:49:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,647 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-05 10:49:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:49:05,647 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2019-08-05 10:49:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,648 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:49:05,649 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:49:05,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:49:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:49:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2019-08-05 10:49:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:49:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-08-05 10:49:05,653 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-08-05 10:49:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,653 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-08-05 10:49:05,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:49:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-08-05 10:49:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:49:05,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,654 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2019-08-05 10:49:05,654 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash -448458437, now seen corresponding path program 63 times [2019-08-05 10:49:05,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:49:07,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:49:07,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:49:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:49:07,490 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 68 states. [2019-08-05 10:49:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,702 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2019-08-05 10:49:09,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:49:09,702 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 101 [2019-08-05 10:49:09,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,704 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:49:09,704 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:49:09,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:49:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:49:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:49:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:49:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-05 10:49:09,706 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2019-08-05 10:49:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,707 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-05 10:49:09,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:49:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-05 10:49:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:49:09,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,707 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2019-08-05 10:49:09,708 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,708 INFO L82 PathProgramCache]: Analyzing trace with hash 495310178, now seen corresponding path program 64 times [2019-08-05 10:49:09,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:10,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:10,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:10,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:49:10,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:49:10,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:49:10,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:49:10,355 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 37 states. [2019-08-05 10:49:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,218 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-05 10:49:11,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:49:11,218 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 102 [2019-08-05 10:49:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,219 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:49:11,219 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:49:11,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:49:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:49:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-08-05 10:49:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:49:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-05 10:49:11,223 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-08-05 10:49:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,223 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-05 10:49:11,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:49:11,223 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-05 10:49:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:49:11,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,224 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2019-08-05 10:49:11,224 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,225 INFO L82 PathProgramCache]: Analyzing trace with hash -748222774, now seen corresponding path program 65 times [2019-08-05 10:49:11,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:12,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:12,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:49:12,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:49:12,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:49:12,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:49:12,695 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 70 states. [2019-08-05 10:49:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,266 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-08-05 10:49:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:49:14,266 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 104 [2019-08-05 10:49:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,267 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:49:14,267 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:49:14,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:49:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:49:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:49:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:49:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-08-05 10:49:14,270 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2019-08-05 10:49:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:14,270 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-08-05 10:49:14,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:49:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-08-05 10:49:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:49:14,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:14,271 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2019-08-05 10:49:14,271 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash 206667075, now seen corresponding path program 66 times [2019-08-05 10:49:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:14,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:49:14,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:14,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:49:14,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:49:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:49:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:49:14,863 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 38 states. [2019-08-05 10:49:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:15,609 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-05 10:49:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:49:15,610 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 105 [2019-08-05 10:49:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:15,611 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:49:15,611 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:49:15,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:49:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:49:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-08-05 10:49:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:49:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-08-05 10:49:15,614 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2019-08-05 10:49:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:15,614 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-08-05 10:49:15,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:49:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-08-05 10:49:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:49:15,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:15,615 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2019-08-05 10:49:15,615 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1038629483, now seen corresponding path program 67 times [2019-08-05 10:49:15,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:15,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:49:15,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:17,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:17,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:49:17,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:49:17,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:49:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:49:17,317 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 72 states. [2019-08-05 10:49:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:18,559 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2019-08-05 10:49:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:49:18,560 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 107 [2019-08-05 10:49:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:18,560 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:49:18,561 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:49:18,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:49:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:49:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:49:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:49:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-05 10:49:18,563 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-08-05 10:49:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:18,563 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-05 10:49:18,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:49:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-05 10:49:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:49:18,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:18,564 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2019-08-05 10:49:18,564 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1701247662, now seen corresponding path program 68 times [2019-08-05 10:49:18,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:18,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:49:18,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:19,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:19,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:19,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:49:19,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:49:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:49:19,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:49:19,243 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 39 states. [2019-08-05 10:49:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:19,991 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-05 10:49:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:49:19,991 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 108 [2019-08-05 10:49:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:19,992 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:49:19,992 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:49:19,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:49:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:49:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-08-05 10:49:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:49:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-05 10:49:19,995 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-08-05 10:49:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:19,996 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-05 10:49:19,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:49:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-05 10:49:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:49:19,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:19,996 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2019-08-05 10:49:19,997 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1483602618, now seen corresponding path program 69 times [2019-08-05 10:49:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:21,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:21,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:49:21,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:49:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:49:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:49:21,808 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 74 states. [2019-08-05 10:49:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:23,112 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-05 10:49:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:49:23,112 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 110 [2019-08-05 10:49:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:23,113 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:49:23,113 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:49:23,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:49:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:49:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:49:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:49:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-08-05 10:49:23,116 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-08-05 10:49:23,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:23,116 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-08-05 10:49:23,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:49:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-08-05 10:49:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:49:23,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:23,117 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2019-08-05 10:49:23,117 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:23,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:23,117 INFO L82 PathProgramCache]: Analyzing trace with hash -637930893, now seen corresponding path program 70 times [2019-08-05 10:49:23,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:23,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:49:23,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:23,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:49:23,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:49:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:49:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:49:23,785 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 40 states. [2019-08-05 10:49:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:24,573 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-08-05 10:49:24,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:49:24,574 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 111 [2019-08-05 10:49:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:24,575 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:49:24,575 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:49:24,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:49:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:49:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2019-08-05 10:49:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:49:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-08-05 10:49:24,578 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2019-08-05 10:49:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:24,579 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-08-05 10:49:24,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:49:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-08-05 10:49:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:49:24,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:24,579 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2019-08-05 10:49:24,579 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1128801179, now seen corresponding path program 71 times [2019-08-05 10:49:24,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:24,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:49:24,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:26,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:26,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:49:26,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:49:26,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:49:26,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:49:26,166 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 76 states. [2019-08-05 10:49:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,237 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2019-08-05 10:49:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:49:28,237 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 113 [2019-08-05 10:49:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,238 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:49:28,239 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:49:28,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:49:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:49:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:49:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:49:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-05 10:49:28,241 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2019-08-05 10:49:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,241 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-05 10:49:28,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:49:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-05 10:49:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:49:28,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,242 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2019-08-05 10:49:28,243 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1032264382, now seen corresponding path program 72 times [2019-08-05 10:49:28,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:29,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:29,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:29,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:49:29,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:49:29,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:49:29,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:49:29,156 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 41 states. [2019-08-05 10:49:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:30,012 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-05 10:49:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:49:30,012 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 114 [2019-08-05 10:49:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:30,013 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:49:30,013 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:49:30,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:49:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:49:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-08-05 10:49:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:49:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-05 10:49:30,016 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-05 10:49:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:30,017 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-05 10:49:30,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:49:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-05 10:49:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:49:30,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:30,017 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2019-08-05 10:49:30,018 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 131440298, now seen corresponding path program 73 times [2019-08-05 10:49:30,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:30,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:49:30,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:31,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:31,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:49:31,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:49:31,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:49:31,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:49:31,932 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 78 states. [2019-08-05 10:49:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:33,319 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-08-05 10:49:33,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:49:33,319 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 116 [2019-08-05 10:49:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:33,320 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:49:33,320 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:49:33,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:49:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:49:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:49:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:49:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-08-05 10:49:33,323 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2019-08-05 10:49:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:33,323 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-08-05 10:49:33,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:49:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-08-05 10:49:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:49:33,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:33,324 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2019-08-05 10:49:33,324 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:33,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:33,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1387079587, now seen corresponding path program 74 times [2019-08-05 10:49:33,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:33,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:49:33,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:34,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:34,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:34,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:49:34,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:49:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:49:34,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:49:34,085 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 42 states. [2019-08-05 10:49:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:35,009 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2019-08-05 10:49:35,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:49:35,010 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 117 [2019-08-05 10:49:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:35,011 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:49:35,011 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:49:35,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:49:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:49:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-08-05 10:49:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:49:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-08-05 10:49:35,014 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2019-08-05 10:49:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:35,014 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-08-05 10:49:35,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:49:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-08-05 10:49:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:49:35,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:35,014 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2019-08-05 10:49:35,015 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:35,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:35,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1543687371, now seen corresponding path program 75 times [2019-08-05 10:49:35,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:35,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:49:35,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:36,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:36,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:49:36,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:49:36,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:49:36,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:49:36,960 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 80 states. [2019-08-05 10:49:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,791 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2019-08-05 10:49:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:49:39,791 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 119 [2019-08-05 10:49:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,792 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:49:39,792 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:49:39,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:49:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:49:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:49:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:49:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-05 10:49:39,794 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2019-08-05 10:49:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,794 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-05 10:49:39,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:49:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-05 10:49:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:49:39,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,795 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2019-08-05 10:49:39,795 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash -871402190, now seen corresponding path program 76 times [2019-08-05 10:49:39,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:40,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:40,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:40,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:49:40,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:49:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:49:40,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:49:40,495 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 43 states. [2019-08-05 10:49:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:41,381 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-05 10:49:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:49:41,382 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 120 [2019-08-05 10:49:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:41,383 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:49:41,383 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:49:41,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:49:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:49:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-08-05 10:49:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:49:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-05 10:49:41,386 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-05 10:49:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:41,387 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-05 10:49:41,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:49:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-05 10:49:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:49:41,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:41,388 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2019-08-05 10:49:41,388 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash 101184154, now seen corresponding path program 77 times [2019-08-05 10:49:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:41,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:49:41,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:43,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:43,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:49:43,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:49:43,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:49:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:49:43,633 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 82 states. [2019-08-05 10:49:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:45,390 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-08-05 10:49:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:49:45,390 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 122 [2019-08-05 10:49:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:45,391 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:49:45,391 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:49:45,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2019-08-05 10:49:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:49:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:49:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:49:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-08-05 10:49:45,394 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2019-08-05 10:49:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:45,394 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-08-05 10:49:45,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:49:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-08-05 10:49:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:49:45,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:45,395 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2019-08-05 10:49:45,395 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1460214995, now seen corresponding path program 78 times [2019-08-05 10:49:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:45,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:49:45,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:46,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:46,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:46,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:49:46,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:49:46,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:49:46,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:49:46,493 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 44 states. [2019-08-05 10:49:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:47,607 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2019-08-05 10:49:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:49:47,608 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 123 [2019-08-05 10:49:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:47,609 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:49:47,609 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:49:47,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:49:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:49:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-08-05 10:49:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:49:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-08-05 10:49:47,612 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2019-08-05 10:49:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:47,613 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-08-05 10:49:47,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:49:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-08-05 10:49:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:49:47,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:47,614 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2019-08-05 10:49:47,614 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:47,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1187629573, now seen corresponding path program 79 times [2019-08-05 10:49:47,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:47,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:49:47,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:49,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:49,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:49:49,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:49:49,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:49:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:49:49,563 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 84 states. [2019-08-05 10:49:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:52,305 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2019-08-05 10:49:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:49:52,305 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 125 [2019-08-05 10:49:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:52,306 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:49:52,306 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:49:52,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 10:49:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:49:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:49:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:49:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-05 10:49:52,309 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2019-08-05 10:49:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:52,309 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-05 10:49:52,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:49:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-05 10:49:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:49:52,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:52,310 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2019-08-05 10:49:52,311 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:52,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1338422562, now seen corresponding path program 80 times [2019-08-05 10:49:52,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:52,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:49:52,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:53,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:49:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:53,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:53,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:49:53,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:49:53,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:49:53,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:49:53,142 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 45 states. [2019-08-05 10:49:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,546 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-05 10:49:54,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:49:54,547 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2019-08-05 10:49:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,548 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:49:54,548 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:49:54,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:49:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:49:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-08-05 10:49:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:49:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-05 10:49:54,552 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-08-05 10:49:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,552 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-05 10:49:54,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:49:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-05 10:49:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:49:54,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,553 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2019-08-05 10:49:54,553 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2028926602, now seen corresponding path program 81 times [2019-08-05 10:49:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:56,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:56,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:49:56,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:49:56,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:49:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:49:56,628 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 86 states. [2019-08-05 10:49:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,228 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2019-08-05 10:49:59,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:49:59,228 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 128 [2019-08-05 10:49:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,229 INFO L225 Difference]: With dead ends: 213 [2019-08-05 10:49:59,229 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:49:59,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2019-08-05 10:49:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:49:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 10:49:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:49:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-08-05 10:49:59,232 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2019-08-05 10:49:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,233 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-08-05 10:49:59,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:49:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-08-05 10:49:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:49:59,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,234 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2019-08-05 10:49:59,234 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash -768880125, now seen corresponding path program 82 times [2019-08-05 10:49:59,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:00,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:00,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:00,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:50:00,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:50:00,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:50:00,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:50:00,478 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 46 states. [2019-08-05 10:50:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:01,499 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-08-05 10:50:01,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:50:01,499 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 129 [2019-08-05 10:50:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:01,500 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:50:01,501 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:50:01,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:50:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:50:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2019-08-05 10:50:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:50:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-08-05 10:50:01,504 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2019-08-05 10:50:01,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:01,505 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-08-05 10:50:01,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:50:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-08-05 10:50:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:50:01,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:01,506 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2019-08-05 10:50:01,506 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:01,506 INFO L82 PathProgramCache]: Analyzing trace with hash -159359189, now seen corresponding path program 83 times [2019-08-05 10:50:01,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:01,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:50:01,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:03,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:03,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:50:03,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:50:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:50:03,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:50:03,953 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 88 states. [2019-08-05 10:50:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:06,827 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2019-08-05 10:50:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:50:06,828 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 131 [2019-08-05 10:50:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:06,829 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:50:06,829 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:50:06,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:50:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:50:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:50:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:50:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-05 10:50:06,831 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2019-08-05 10:50:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:06,832 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-05 10:50:06,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:50:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-05 10:50:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:50:06,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:06,833 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2019-08-05 10:50:06,833 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:06,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:06,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1484217070, now seen corresponding path program 84 times [2019-08-05 10:50:06,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:06,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:50:06,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:08,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:08,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:08,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:50:08,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:50:08,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:50:08,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:50:08,355 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 47 states. [2019-08-05 10:50:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:09,446 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-05 10:50:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:50:09,447 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 132 [2019-08-05 10:50:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:09,448 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:50:09,448 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:50:09,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:50:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:50:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-08-05 10:50:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:50:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-05 10:50:09,451 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-08-05 10:50:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:09,452 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-05 10:50:09,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:50:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-05 10:50:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:50:09,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:09,453 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2019-08-05 10:50:09,453 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash -403395974, now seen corresponding path program 85 times [2019-08-05 10:50:09,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:09,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:50:09,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:11,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:11,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:50:11,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:50:11,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:50:11,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:50:11,705 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 90 states. [2019-08-05 10:50:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:13,802 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2019-08-05 10:50:13,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:50:13,803 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 134 [2019-08-05 10:50:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:13,804 INFO L225 Difference]: With dead ends: 223 [2019-08-05 10:50:13,804 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:50:13,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2019-08-05 10:50:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:50:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 10:50:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:50:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-08-05 10:50:13,807 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2019-08-05 10:50:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:13,807 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-08-05 10:50:13,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:50:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-08-05 10:50:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:50:13,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:13,808 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2019-08-05 10:50:13,808 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1504921395, now seen corresponding path program 86 times [2019-08-05 10:50:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:13,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:50:13,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:14,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:14,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:14,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:50:14,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:50:14,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:50:14,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:50:14,697 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 48 states. [2019-08-05 10:50:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:15,748 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-08-05 10:50:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:50:15,748 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 135 [2019-08-05 10:50:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:15,750 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:50:15,750 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:50:15,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:50:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:50:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-08-05 10:50:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:50:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-08-05 10:50:15,754 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2019-08-05 10:50:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:15,754 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-08-05 10:50:15,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:50:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-08-05 10:50:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:50:15,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:15,755 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2019-08-05 10:50:15,755 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1174452133, now seen corresponding path program 87 times [2019-08-05 10:50:15,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:15,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:50:15,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:18,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:18,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:50:18,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:50:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:50:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:50:18,367 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 92 states. [2019-08-05 10:50:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:21,729 INFO L93 Difference]: Finished difference Result 228 states and 229 transitions. [2019-08-05 10:50:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:50:21,729 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 137 [2019-08-05 10:50:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:21,730 INFO L225 Difference]: With dead ends: 228 [2019-08-05 10:50:21,730 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:50:21,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2019-08-05 10:50:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:50:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-05 10:50:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:50:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-05 10:50:21,733 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2019-08-05 10:50:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:21,733 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-05 10:50:21,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:50:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-05 10:50:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:50:21,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:21,734 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2019-08-05 10:50:21,734 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:21,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1321157890, now seen corresponding path program 88 times [2019-08-05 10:50:21,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:21,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:50:21,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:22,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:22,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:22,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:50:22,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:50:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:50:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:50:22,703 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 49 states. [2019-08-05 10:50:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:23,955 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-08-05 10:50:23,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:50:23,955 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 138 [2019-08-05 10:50:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:23,956 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:50:23,957 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:50:23,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:50:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:50:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2019-08-05 10:50:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:50:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-05 10:50:23,960 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-05 10:50:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:23,961 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-05 10:50:23,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:50:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-05 10:50:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:50:23,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:23,962 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2019-08-05 10:50:23,962 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1677521302, now seen corresponding path program 89 times [2019-08-05 10:50:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:24,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:50:24,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:26,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:26,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:50:26,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:50:26,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:50:26,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:50:26,425 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 94 states. [2019-08-05 10:50:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:30,362 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2019-08-05 10:50:30,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:50:30,362 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 140 [2019-08-05 10:50:30,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:30,363 INFO L225 Difference]: With dead ends: 233 [2019-08-05 10:50:30,363 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:50:30,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2019-08-05 10:50:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:50:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-05 10:50:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:50:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-08-05 10:50:30,366 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2019-08-05 10:50:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:30,366 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-08-05 10:50:30,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:50:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-08-05 10:50:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:50:30,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:30,367 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2019-08-05 10:50:30,367 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -843219869, now seen corresponding path program 90 times [2019-08-05 10:50:30,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:30,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:50:30,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:31,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:31,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:31,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:50:31,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:50:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:50:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:50:31,297 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 50 states. [2019-08-05 10:50:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:32,484 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-08-05 10:50:32,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:50:32,485 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 141 [2019-08-05 10:50:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:32,486 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:50:32,486 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:50:32,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:50:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:50:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-08-05 10:50:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:50:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-08-05 10:50:32,489 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-08-05 10:50:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:32,489 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-08-05 10:50:32,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:50:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-08-05 10:50:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:50:32,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:32,490 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2019-08-05 10:50:32,490 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:32,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1414590859, now seen corresponding path program 91 times [2019-08-05 10:50:32,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:32,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:50:32,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:35,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:35,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:50:35,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:50:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:50:35,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:50:35,226 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 96 states. [2019-08-05 10:50:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:37,772 INFO L93 Difference]: Finished difference Result 238 states and 239 transitions. [2019-08-05 10:50:37,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:50:37,773 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 143 [2019-08-05 10:50:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:37,774 INFO L225 Difference]: With dead ends: 238 [2019-08-05 10:50:37,774 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:50:37,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2019-08-05 10:50:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:50:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-05 10:50:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:50:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-05 10:50:37,777 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2019-08-05 10:50:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:37,777 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-05 10:50:37,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:50:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-05 10:50:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:50:37,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:37,778 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2019-08-05 10:50:37,778 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:37,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:37,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1112839410, now seen corresponding path program 92 times [2019-08-05 10:50:37,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:50:37,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:39,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:39,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:39,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:50:39,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:50:39,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:50:39,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:50:39,034 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 51 states. [2019-08-05 10:50:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:40,220 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-08-05 10:50:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:50:40,221 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 144 [2019-08-05 10:50:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:40,222 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:50:40,222 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:50:40,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:50:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:50:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2019-08-05 10:50:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:50:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-05 10:50:40,225 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-08-05 10:50:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:40,225 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-05 10:50:40,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:50:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-05 10:50:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 10:50:40,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:40,226 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2019-08-05 10:50:40,226 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash -8117670, now seen corresponding path program 93 times [2019-08-05 10:50:40,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:40,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:50:40,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:42,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:42,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:50:42,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:50:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:50:42,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:50:42,836 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 98 states. [2019-08-05 10:50:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:46,805 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2019-08-05 10:50:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:50:46,805 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 146 [2019-08-05 10:50:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:46,806 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:50:46,806 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:50:46,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2019-08-05 10:50:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:50:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:50:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:50:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-08-05 10:50:46,809 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2019-08-05 10:50:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:46,809 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-08-05 10:50:46,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:50:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-08-05 10:50:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:50:46,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:46,810 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2019-08-05 10:50:46,810 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash -118984301, now seen corresponding path program 94 times [2019-08-05 10:50:46,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:46,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:50:46,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:47,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:47,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:47,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:50:47,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:50:47,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:50:47,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:50:47,812 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 52 states. [2019-08-05 10:50:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:49,266 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2019-08-05 10:50:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:50:49,266 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 147 [2019-08-05 10:50:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:49,267 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:50:49,267 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:50:49,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:50:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:50:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2019-08-05 10:50:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:50:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-08-05 10:50:49,271 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-08-05 10:50:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:49,271 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-08-05 10:50:49,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:50:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-08-05 10:50:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:50:49,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:49,272 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2019-08-05 10:50:49,272 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1620269755, now seen corresponding path program 95 times [2019-08-05 10:50:49,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:49,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:50:49,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:51,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:51,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:50:51,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:50:51,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:50:51,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:50:51,976 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 100 states. [2019-08-05 10:50:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:56,033 INFO L93 Difference]: Finished difference Result 248 states and 249 transitions. [2019-08-05 10:50:56,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:50:56,034 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 149 [2019-08-05 10:50:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:56,035 INFO L225 Difference]: With dead ends: 248 [2019-08-05 10:50:56,035 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:50:56,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2019-08-05 10:50:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:50:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:50:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:50:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-05 10:50:56,037 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2019-08-05 10:50:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:56,038 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-05 10:50:56,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:50:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-05 10:50:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:50:56,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:56,039 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2019-08-05 10:50:56,039 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1622316258, now seen corresponding path program 96 times [2019-08-05 10:50:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:56,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:50:56,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:57,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:50:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:57,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:57,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:50:57,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:50:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:50:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:50:57,137 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 53 states. [2019-08-05 10:50:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:58,399 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-08-05 10:50:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:50:58,399 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 150 [2019-08-05 10:50:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:58,400 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:50:58,400 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:50:58,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:50:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:50:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-08-05 10:50:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:50:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-05 10:50:58,403 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-08-05 10:50:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:58,404 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-05 10:50:58,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:50:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-05 10:50:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:50:58,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:58,405 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2019-08-05 10:50:58,405 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:58,405 INFO L82 PathProgramCache]: Analyzing trace with hash -27138486, now seen corresponding path program 97 times [2019-08-05 10:50:58,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:58,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:50:58,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:01,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:01,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:51:01,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:51:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:51:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:51:01,474 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 102 states. [2019-08-05 10:51:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:04,117 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2019-08-05 10:51:04,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:51:04,117 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 152 [2019-08-05 10:51:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:04,118 INFO L225 Difference]: With dead ends: 253 [2019-08-05 10:51:04,118 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:51:04,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2019-08-05 10:51:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:51:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 10:51:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:51:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-08-05 10:51:04,121 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2019-08-05 10:51:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:04,121 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-08-05 10:51:04,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:51:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-08-05 10:51:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:51:04,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:04,122 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2019-08-05 10:51:04,122 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash 810690243, now seen corresponding path program 98 times [2019-08-05 10:51:04,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:04,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:51:04,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:05,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:05,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:05,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:51:05,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:51:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:51:05,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:51:05,228 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 54 states. [2019-08-05 10:51:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:06,512 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2019-08-05 10:51:06,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:51:06,513 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 153 [2019-08-05 10:51:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:06,514 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:51:06,514 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:51:06,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:51:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:51:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-08-05 10:51:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:51:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2019-08-05 10:51:06,517 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2019-08-05 10:51:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:06,517 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2019-08-05 10:51:06,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:51:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2019-08-05 10:51:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 10:51:06,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:06,519 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2019-08-05 10:51:06,519 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:06,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1684308971, now seen corresponding path program 99 times [2019-08-05 10:51:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:06,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:51:06,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:09,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:09,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:51:09,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:51:09,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:51:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:51:09,786 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 104 states. [2019-08-05 10:51:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:15,504 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2019-08-05 10:51:15,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:51:15,504 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 155 [2019-08-05 10:51:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:15,506 INFO L225 Difference]: With dead ends: 258 [2019-08-05 10:51:15,506 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:51:15,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2019-08-05 10:51:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:51:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-05 10:51:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:51:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-05 10:51:15,508 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2019-08-05 10:51:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:15,509 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-05 10:51:15,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:51:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-05 10:51:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:51:15,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:15,510 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2019-08-05 10:51:15,510 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash -909949742, now seen corresponding path program 100 times [2019-08-05 10:51:15,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:15,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:51:15,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:16,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:16,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:16,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:51:16,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:51:16,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:51:16,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:51:16,701 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 55 states. [2019-08-05 10:51:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:18,068 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-05 10:51:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:51:18,069 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 156 [2019-08-05 10:51:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:18,070 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:51:18,071 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:51:18,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:51:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:51:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-08-05 10:51:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:51:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-05 10:51:18,074 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-08-05 10:51:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:18,074 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-05 10:51:18,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:51:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-05 10:51:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:51:18,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:18,084 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2019-08-05 10:51:18,084 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1711692346, now seen corresponding path program 101 times [2019-08-05 10:51:18,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:18,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:51:18,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:21,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:51:21,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:51:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:51:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:51:21,373 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 106 states. [2019-08-05 10:51:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:27,276 INFO L93 Difference]: Finished difference Result 263 states and 264 transitions. [2019-08-05 10:51:27,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:51:27,276 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 158 [2019-08-05 10:51:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:27,278 INFO L225 Difference]: With dead ends: 263 [2019-08-05 10:51:27,278 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:51:27,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2019-08-05 10:51:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:51:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 10:51:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:51:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-08-05 10:51:27,281 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2019-08-05 10:51:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:27,281 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-08-05 10:51:27,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:51:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-08-05 10:51:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:51:27,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:27,282 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2019-08-05 10:51:27,282 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:27,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash -208102413, now seen corresponding path program 102 times [2019-08-05 10:51:27,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:27,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:51:27,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:28,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:28,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:28,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:51:28,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:51:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:51:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:51:28,621 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 56 states. [2019-08-05 10:51:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:30,093 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2019-08-05 10:51:30,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:51:30,094 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 159 [2019-08-05 10:51:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:30,094 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:51:30,095 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:51:30,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:51:30,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:51:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2019-08-05 10:51:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:51:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-08-05 10:51:30,098 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2019-08-05 10:51:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:30,098 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-08-05 10:51:30,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:51:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-08-05 10:51:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:51:30,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:30,099 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1] [2019-08-05 10:51:30,100 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:30,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1877110043, now seen corresponding path program 103 times [2019-08-05 10:51:30,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:30,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:51:30,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:33,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:33,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:51:33,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:51:33,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:51:33,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:51:33,281 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 108 states. [2019-08-05 10:51:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:39,213 INFO L93 Difference]: Finished difference Result 268 states and 269 transitions. [2019-08-05 10:51:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:51:39,214 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 161 [2019-08-05 10:51:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:39,214 INFO L225 Difference]: With dead ends: 268 [2019-08-05 10:51:39,214 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:51:39,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2019-08-05 10:51:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:51:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-05 10:51:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:51:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-08-05 10:51:39,217 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2019-08-05 10:51:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:39,218 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-08-05 10:51:39,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:51:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-08-05 10:51:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-05 10:51:39,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:39,219 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2019-08-05 10:51:39,219 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1055958210, now seen corresponding path program 104 times [2019-08-05 10:51:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:39,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:51:39,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:40,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:40,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:40,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:51:40,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:51:40,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:51:40,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:51:40,771 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 57 states. [2019-08-05 10:51:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:42,183 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-08-05 10:51:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:51:42,184 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 162 [2019-08-05 10:51:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:42,185 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:51:42,185 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:51:42,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:51:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:51:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2019-08-05 10:51:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:51:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-08-05 10:51:42,189 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-08-05 10:51:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:42,189 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-08-05 10:51:42,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:51:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-08-05 10:51:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:51:42,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:42,190 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1] [2019-08-05 10:51:42,191 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:42,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1163623978, now seen corresponding path program 105 times [2019-08-05 10:51:42,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:42,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:51:42,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:45,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:45,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:51:45,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:51:45,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:51:45,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:51:45,640 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 110 states. [2019-08-05 10:51:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:48,791 INFO L93 Difference]: Finished difference Result 273 states and 274 transitions. [2019-08-05 10:51:48,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:51:48,792 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 164 [2019-08-05 10:51:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:48,793 INFO L225 Difference]: With dead ends: 273 [2019-08-05 10:51:48,793 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:51:48,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2019-08-05 10:51:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:51:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 10:51:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:51:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-08-05 10:51:48,796 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2019-08-05 10:51:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:48,796 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-08-05 10:51:48,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:51:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-08-05 10:51:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:51:48,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:48,797 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2019-08-05 10:51:48,797 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1931882205, now seen corresponding path program 106 times [2019-08-05 10:51:48,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:48,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:51:48,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:50,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:51:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:50,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:50,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:51:50,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:51:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:51:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:51:50,260 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 58 states. [2019-08-05 10:51:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:51,732 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2019-08-05 10:51:51,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:51:51,732 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 165 [2019-08-05 10:51:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:51,733 INFO L225 Difference]: With dead ends: 172 [2019-08-05 10:51:51,733 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:51:51,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:51:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:51:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2019-08-05 10:51:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:51:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-08-05 10:51:51,737 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2019-08-05 10:51:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:51,737 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-08-05 10:51:51,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:51:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-08-05 10:51:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 10:51:51,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:51,738 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1] [2019-08-05 10:51:51,738 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:51,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1112861109, now seen corresponding path program 107 times [2019-08-05 10:51:51,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:51,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:51:51,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:51:54,533 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:51:54,533 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:51:54,538 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:51:54,538 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:51:54 BoogieIcfgContainer [2019-08-05 10:51:54,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:51:54,541 INFO L168 Benchmark]: Toolchain (without parser) took 242467.88 ms. Allocated memory was 142.1 MB in the beginning and 487.6 MB in the end (delta: 345.5 MB). Free memory was 111.6 MB in the beginning and 11.2 MB in the end (delta: 100.4 MB). Peak memory consumption was 446.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:54,542 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 142.1 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:51:54,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.45 ms. Allocated memory is still 142.1 MB. Free memory was 111.4 MB in the beginning and 109.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:54,543 INFO L168 Benchmark]: Boogie Preprocessor took 23.22 ms. Allocated memory is still 142.1 MB. Free memory was 109.8 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:54,544 INFO L168 Benchmark]: RCFGBuilder took 442.20 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 97.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:54,544 INFO L168 Benchmark]: TraceAbstraction took 241962.03 ms. Allocated memory was 142.1 MB in the beginning and 487.6 MB in the end (delta: 345.5 MB). Free memory was 96.9 MB in the beginning and 11.2 MB in the end (delta: 85.7 MB). Peak memory consumption was 431.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:54,547 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.16 ms. Allocated memory is still 142.1 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.45 ms. Allocated memory is still 142.1 MB. Free memory was 111.4 MB in the beginning and 109.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.22 ms. Allocated memory is still 142.1 MB. Free memory was 109.8 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 442.20 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 97.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241962.03 ms. Allocated memory was 142.1 MB in the beginning and 487.6 MB in the end (delta: 345.5 MB). Free memory was 96.9 MB in the beginning and 11.2 MB in the end (delta: 85.7 MB). Peak memory consumption was 431.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 76). Cancelled while BasicCegarLoop was analyzing trace of length 168 with TraceHistMax 55,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 100 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 241.8s OverallTime, 109 OverallIterations, 55 TraceHistogramMax, 128.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 380 SDtfs, 740 SDslu, 2368 SDs, 0 SdLazy, 73918 SolverSat, 6032 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12096 GetRequests, 4509 SyntacticMatches, 0 SemanticMatches, 7587 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132714 ImplicationChecksByTransitivity, 169.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=108, 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.2s AutomataMinimizationTime, 108 MinimizatonAttempts, 216 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 106.3s InterpolantComputationTime, 9180 NumberOfCodeBlocks, 9180 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 9072 ConstructedInterpolants, 0 QuantifiedInterpolants, 2967408 SizeOfPredicates, 324 NumberOfNonLiveVariables, 42498 ConjunctsInSsa, 6210 ConjunctsInUnsatCore, 108 InterpolantComputations, 2 PerfectInterpolantSequences, 80190/158895 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown