java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-b8c145f
[2019-08-04 21:21:47,809 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-08-04 21:21:47,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-08-04 21:21:47,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-08-04 21:21:47,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-08-04 21:21:47,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-08-04 21:21:47,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-08-04 21:21:47,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-08-04 21:21:47,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-08-04 21:21:47,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-08-04 21:21:47,835 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values
[2019-08-04 21:21:47,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-08-04 21:21:47,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-08-04 21:21:47,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-08-04 21:21:47,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-08-04 21:21:47,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-08-04 21:21:47,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-08-04 21:21:47,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-08-04 21:21:47,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-08-04 21:21:47,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-08-04 21:21:47,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-08-04 21:21:47,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-08-04 21:21:47,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-08-04 21:21:47,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-08-04 21:21:47,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-08-04 21:21:47,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-08-04 21:21:47,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-08-04 21:21:47,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-08-04 21:21:47,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-08-04 21:21:47,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-08-04 21:21:47,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-08-04 21:21:47,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-08-04 21:21:47,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-08-04 21:21:47,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-08-04 21:21:47,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-08-04 21:21:47,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-08-04 21:21:47,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-08-04 21:21:47,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-08-04 21:21:47,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-08-04 21:21:47,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-08-04 21:21:47,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-08-04 21:21:47,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-08-04 21:21:47,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-08-04 21:21:47,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-08-04 21:21:47,922 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2019-08-04 21:21:47,923 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized
[2019-08-04 21:21:47,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl
[2019-08-04 21:21:47,925 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl'
[2019-08-04 21:21:47,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-08-04 21:21:47,966 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-08-04 21:21:47,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-08-04 21:21:47,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-08-04 21:21:47,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2019-08-04 21:21:47,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:47,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:48,002 WARN L165 Inliner]: Program contained no entry procedure!
[2019-08-04 21:21:48,002 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start]
[2019-08-04 21:21:48,002 WARN L175 Inliner]: Fallback enabled. All procedures will be processed.
[2019-08-04 21:21:48,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-08-04 21:21:48,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-08-04 21:21:48,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-08-04 21:21:48,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-08-04 21:21:48,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:48,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:48,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:48,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:48,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:48,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:48,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/1) ...
[2019-08-04 21:21:48,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-08-04 21:21:48,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-08-04 21:21:48,031 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-08-04 21:21:48,031 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-08-04 21:21:48,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (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-04 21:21:48,099 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration
[2019-08-04 21:21:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure product
[2019-08-04 21:21:48,099 INFO L138 BoogieDeclarations]: Found implementation of procedure product
[2019-08-04 21:21:48,469 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true;
[2019-08-04 21:21:48,471 INFO L275 CfgBuilder]: Using library mode
[2019-08-04 21:21:48,471 INFO L283 CfgBuilder]: Removed 0 assume(true) statements.
[2019-08-04 21:21:48,472 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:48 BoogieIcfgContainer
[2019-08-04 21:21:48,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-08-04 21:21:48,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-08-04 21:21:48,474 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-08-04 21:21:48,477 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-08-04 21:21:48,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:47" (1/2) ...
[2019-08-04 21:21:48,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138207dd and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:21:48, skipping insertion in model container
[2019-08-04 21:21:48,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:48" (2/2) ...
[2019-08-04 21:21:48,481 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl
[2019-08-04 21:21:48,490 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2019-08-04 21:21:48,498 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations.
[2019-08-04 21:21:48,515 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2019-08-04 21:21:48,540 INFO L128 ementStrategyFactory]: Using default assertion order modulation
[2019-08-04 21:21:48,541 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2019-08-04 21:21:48,541 INFO L378 AbstractCegarLoop]: Hoare is false
[2019-08-04 21:21:48,542 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates
[2019-08-04 21:21:48,542 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-08-04 21:21:48,542 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-08-04 21:21:48,542 INFO L382 AbstractCegarLoop]: Difference is false
[2019-08-04 21:21:48,542 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-08-04 21:21:48,543 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-08-04 21:21:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states.
[2019-08-04 21:21:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2019-08-04 21:21:48,564 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:48,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2019-08-04 21:21:48,567 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times
[2019-08-04 21:21:48,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:48,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core
[2019-08-04 21:21:48,664 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:48,819 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-04 21:21:48,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-08-04 21:21:48,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-08-04 21:21:48,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-08-04 21:21:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-08-04 21:21:48,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-08-04 21:21:48,839 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states.
[2019-08-04 21:21:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:49,372 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions.
[2019-08-04 21:21:49,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-08-04 21:21:49,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4
[2019-08-04 21:21:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:49,396 INFO L225 Difference]: With dead ends: 30
[2019-08-04 21:21:49,397 INFO L226 Difference]: Without dead ends: 30
[2019-08-04 21:21:49,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-08-04 21:21:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2019-08-04 21:21:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24.
[2019-08-04 21:21:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2019-08-04 21:21:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions.
[2019-08-04 21:21:49,446 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4
[2019-08-04 21:21:49,447 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:49,447 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions.
[2019-08-04 21:21:49,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-08-04 21:21:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions.
[2019-08-04 21:21:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2019-08-04 21:21:49,448 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:49,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2019-08-04 21:21:49,448 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times
[2019-08-04 21:21:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:49,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core
[2019-08-04 21:21:49,460 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:49,614 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-04 21:21:49,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-08-04 21:21:49,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-08-04 21:21:49,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-08-04 21:21:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-08-04 21:21:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-08-04 21:21:49,618 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states.
[2019-08-04 21:21:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:49,923 INFO L93 Difference]: Finished difference Result 36 states and 59 transitions.
[2019-08-04 21:21:49,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-08-04 21:21:49,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4
[2019-08-04 21:21:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:49,925 INFO L225 Difference]: With dead ends: 36
[2019-08-04 21:21:49,926 INFO L226 Difference]: Without dead ends: 36
[2019-08-04 21:21:49,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-08-04 21:21:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2019-08-04 21:21:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30.
[2019-08-04 21:21:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2019-08-04 21:21:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions.
[2019-08-04 21:21:49,933 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4
[2019-08-04 21:21:49,933 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:49,934 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions.
[2019-08-04 21:21:49,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-08-04 21:21:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions.
[2019-08-04 21:21:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2019-08-04 21:21:49,935 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:49,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2019-08-04 21:21:49,936 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times
[2019-08-04 21:21:49,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:49,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core
[2019-08-04 21:21:49,950 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:50,060 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-04 21:21:50,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-08-04 21:21:50,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-08-04 21:21:50,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-08-04 21:21:50,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-08-04 21:21:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-08-04 21:21:50,062 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states.
[2019-08-04 21:21:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:50,666 INFO L93 Difference]: Finished difference Result 44 states and 73 transitions.
[2019-08-04 21:21:50,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-08-04 21:21:50,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5
[2019-08-04 21:21:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:50,668 INFO L225 Difference]: With dead ends: 44
[2019-08-04 21:21:50,669 INFO L226 Difference]: Without dead ends: 44
[2019-08-04 21:21:50,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:21:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2019-08-04 21:21:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34.
[2019-08-04 21:21:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2019-08-04 21:21:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 55 transitions.
[2019-08-04 21:21:50,676 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 55 transitions. Word has length 5
[2019-08-04 21:21:50,676 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:50,677 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 55 transitions.
[2019-08-04 21:21:50,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-08-04 21:21:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 55 transitions.
[2019-08-04 21:21:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2019-08-04 21:21:50,677 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:50,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2019-08-04 21:21:50,678 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times
[2019-08-04 21:21:50,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:50,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core
[2019-08-04 21:21:50,690 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:50,795 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-04 21:21:50,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-08-04 21:21:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-08-04 21:21:50,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-08-04 21:21:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-08-04 21:21:50,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-08-04 21:21:50,798 INFO L87 Difference]: Start difference. First operand 34 states and 55 transitions. Second operand 6 states.
[2019-08-04 21:21:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:51,071 INFO L93 Difference]: Finished difference Result 48 states and 81 transitions.
[2019-08-04 21:21:51,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-08-04 21:21:51,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5
[2019-08-04 21:21:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:51,073 INFO L225 Difference]: With dead ends: 48
[2019-08-04 21:21:51,073 INFO L226 Difference]: Without dead ends: 48
[2019-08-04 21:21:51,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:21:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2019-08-04 21:21:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37.
[2019-08-04 21:21:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2019-08-04 21:21:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions.
[2019-08-04 21:21:51,079 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 5
[2019-08-04 21:21:51,079 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:51,080 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions.
[2019-08-04 21:21:51,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-08-04 21:21:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions.
[2019-08-04 21:21:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-08-04 21:21:51,081 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:51,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:51,081 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:51,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:51,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times
[2019-08-04 21:21:51,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:51,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core
[2019-08-04 21:21:51,099 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:51,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:51,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2019-08-04 21:21:51,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:51,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:51,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:51,173 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 7 states.
[2019-08-04 21:21:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:52,322 INFO L93 Difference]: Finished difference Result 94 states and 156 transitions.
[2019-08-04 21:21:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:21:52,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2019-08-04 21:21:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:52,326 INFO L225 Difference]: With dead ends: 94
[2019-08-04 21:21:52,326 INFO L226 Difference]: Without dead ends: 94
[2019-08-04 21:21:52,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2019-08-04 21:21:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2019-08-04 21:21:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67.
[2019-08-04 21:21:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2019-08-04 21:21:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 116 transitions.
[2019-08-04 21:21:52,336 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 116 transitions. Word has length 8
[2019-08-04 21:21:52,336 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:52,336 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 116 transitions.
[2019-08-04 21:21:52,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 116 transitions.
[2019-08-04 21:21:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-08-04 21:21:52,337 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:52,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:52,338 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times
[2019-08-04 21:21:52,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:52,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core
[2019-08-04 21:21:52,353 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:52,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:52,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:21:52,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states
[2019-08-04 21:21:52,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2019-08-04 21:21:52,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2019-08-04 21:21:52,768 INFO L87 Difference]: Start difference. First operand 67 states and 116 transitions. Second operand 8 states.
[2019-08-04 21:21:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:53,537 INFO L93 Difference]: Finished difference Result 130 states and 212 transitions.
[2019-08-04 21:21:53,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2019-08-04 21:21:53,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8
[2019-08-04 21:21:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:53,540 INFO L225 Difference]: With dead ends: 130
[2019-08-04 21:21:53,540 INFO L226 Difference]: Without dead ends: 130
[2019-08-04 21:21:53,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2019-08-04 21:21:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2019-08-04 21:21:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 89.
[2019-08-04 21:21:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2019-08-04 21:21:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 156 transitions.
[2019-08-04 21:21:53,551 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 156 transitions. Word has length 8
[2019-08-04 21:21:53,551 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:53,551 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 156 transitions.
[2019-08-04 21:21:53,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2019-08-04 21:21:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 156 transitions.
[2019-08-04 21:21:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-08-04 21:21:53,553 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:53,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:53,553 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1965444251, now seen corresponding path program 1 times
[2019-08-04 21:21:53,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:53,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core
[2019-08-04 21:21:53,566 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:53,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:53,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2019-08-04 21:21:53,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:53,701 INFO L87 Difference]: Start difference. First operand 89 states and 156 transitions. Second operand 7 states.
[2019-08-04 21:21:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:53,987 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions.
[2019-08-04 21:21:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2019-08-04 21:21:53,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2019-08-04 21:21:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:53,988 INFO L225 Difference]: With dead ends: 112
[2019-08-04 21:21:53,988 INFO L226 Difference]: Without dead ends: 112
[2019-08-04 21:21:53,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:21:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2019-08-04 21:21:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91.
[2019-08-04 21:21:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2019-08-04 21:21:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 158 transitions.
[2019-08-04 21:21:54,000 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 158 transitions. Word has length 8
[2019-08-04 21:21:54,000 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:54,000 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 158 transitions.
[2019-08-04 21:21:54,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 158 transitions.
[2019-08-04 21:21:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-08-04 21:21:54,001 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:54,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:54,010 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times
[2019-08-04 21:21:54,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:54,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core
[2019-08-04 21:21:54,023 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:54,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:54,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2019-08-04 21:21:54,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:54,084 INFO L87 Difference]: Start difference. First operand 91 states and 158 transitions. Second operand 7 states.
[2019-08-04 21:21:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:54,548 INFO L93 Difference]: Finished difference Result 151 states and 259 transitions.
[2019-08-04 21:21:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2019-08-04 21:21:54,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2019-08-04 21:21:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:54,552 INFO L225 Difference]: With dead ends: 151
[2019-08-04 21:21:54,552 INFO L226 Difference]: Without dead ends: 151
[2019-08-04 21:21:54,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:21:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2019-08-04 21:21:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105.
[2019-08-04 21:21:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states.
[2019-08-04 21:21:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 186 transitions.
[2019-08-04 21:21:54,562 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 186 transitions. Word has length 8
[2019-08-04 21:21:54,563 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:54,563 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 186 transitions.
[2019-08-04 21:21:54,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 186 transitions.
[2019-08-04 21:21:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-08-04 21:21:54,564 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:54,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:54,564 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times
[2019-08-04 21:21:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:54,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core
[2019-08-04 21:21:54,575 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:54,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:54,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2019-08-04 21:21:54,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:54,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:54,626 INFO L87 Difference]: Start difference. First operand 105 states and 186 transitions. Second operand 7 states.
[2019-08-04 21:21:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:54,931 INFO L93 Difference]: Finished difference Result 179 states and 311 transitions.
[2019-08-04 21:21:54,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2019-08-04 21:21:54,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2019-08-04 21:21:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:54,933 INFO L225 Difference]: With dead ends: 179
[2019-08-04 21:21:54,933 INFO L226 Difference]: Without dead ends: 179
[2019-08-04 21:21:54,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:21:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2019-08-04 21:21:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 138.
[2019-08-04 21:21:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states.
[2019-08-04 21:21:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 244 transitions.
[2019-08-04 21:21:54,942 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 244 transitions. Word has length 8
[2019-08-04 21:21:54,942 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:54,942 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 244 transitions.
[2019-08-04 21:21:54,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 244 transitions.
[2019-08-04 21:21:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-08-04 21:21:54,943 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:54,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:54,944 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times
[2019-08-04 21:21:54,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:54,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core
[2019-08-04 21:21:54,954 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:55,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:55,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2019-08-04 21:21:55,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:55,017 INFO L87 Difference]: Start difference. First operand 138 states and 244 transitions. Second operand 7 states.
[2019-08-04 21:21:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:55,388 INFO L93 Difference]: Finished difference Result 211 states and 369 transitions.
[2019-08-04 21:21:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:21:55,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2019-08-04 21:21:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:55,391 INFO L225 Difference]: With dead ends: 211
[2019-08-04 21:21:55,391 INFO L226 Difference]: Without dead ends: 211
[2019-08-04 21:21:55,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2019-08-04 21:21:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2019-08-04 21:21:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 170.
[2019-08-04 21:21:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states.
[2019-08-04 21:21:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 301 transitions.
[2019-08-04 21:21:55,401 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 301 transitions. Word has length 8
[2019-08-04 21:21:55,401 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:55,401 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 301 transitions.
[2019-08-04 21:21:55,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 301 transitions.
[2019-08-04 21:21:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-08-04 21:21:55,402 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:55,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:55,403 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times
[2019-08-04 21:21:55,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:55,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core
[2019-08-04 21:21:55,413 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:55,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2019-08-04 21:21:55,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:55,464 INFO L87 Difference]: Start difference. First operand 170 states and 301 transitions. Second operand 7 states.
[2019-08-04 21:21:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:55,865 INFO L93 Difference]: Finished difference Result 285 states and 503 transitions.
[2019-08-04 21:21:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2019-08-04 21:21:55,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2019-08-04 21:21:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:55,869 INFO L225 Difference]: With dead ends: 285
[2019-08-04 21:21:55,869 INFO L226 Difference]: Without dead ends: 285
[2019-08-04 21:21:55,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:21:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states.
[2019-08-04 21:21:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 203.
[2019-08-04 21:21:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states.
[2019-08-04 21:21:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 363 transitions.
[2019-08-04 21:21:55,878 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 363 transitions. Word has length 8
[2019-08-04 21:21:55,878 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:55,878 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 363 transitions.
[2019-08-04 21:21:55,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 363 transitions.
[2019-08-04 21:21:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:21:55,880 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:55,880 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1]
[2019-08-04 21:21:55,880 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1748588753, now seen corresponding path program 2 times
[2019-08-04 21:21:55,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:55,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:21:55,893 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:56,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:56,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:21:56,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:56,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:56,019 INFO L87 Difference]: Start difference. First operand 203 states and 363 transitions. Second operand 7 states.
[2019-08-04 21:21:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:56,473 INFO L93 Difference]: Finished difference Result 372 states and 663 transitions.
[2019-08-04 21:21:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2019-08-04 21:21:56,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:21:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:56,479 INFO L225 Difference]: With dead ends: 372
[2019-08-04 21:21:56,479 INFO L226 Difference]: Without dead ends: 372
[2019-08-04 21:21:56,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240
[2019-08-04 21:21:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2019-08-04 21:21:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 282.
[2019-08-04 21:21:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states.
[2019-08-04 21:21:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 509 transitions.
[2019-08-04 21:21:56,489 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 509 transitions. Word has length 11
[2019-08-04 21:21:56,489 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:56,489 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 509 transitions.
[2019-08-04 21:21:56,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 509 transitions.
[2019-08-04 21:21:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:21:56,491 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:56,491 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:56,492 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:56,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times
[2019-08-04 21:21:56,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:56,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:21:56,503 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:56,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:56,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:21:56,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:56,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:56,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:56,688 INFO L87 Difference]: Start difference. First operand 282 states and 509 transitions. Second operand 7 states.
[2019-08-04 21:21:57,430 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10
[2019-08-04 21:21:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:57,803 INFO L93 Difference]: Finished difference Result 388 states and 689 transitions.
[2019-08-04 21:21:57,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:21:57,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:21:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:57,807 INFO L225 Difference]: With dead ends: 388
[2019-08-04 21:21:57,807 INFO L226 Difference]: Without dead ends: 388
[2019-08-04 21:21:57,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:21:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states.
[2019-08-04 21:21:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 291.
[2019-08-04 21:21:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states.
[2019-08-04 21:21:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 524 transitions.
[2019-08-04 21:21:57,816 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 524 transitions. Word has length 11
[2019-08-04 21:21:57,816 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:57,816 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 524 transitions.
[2019-08-04 21:21:57,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 524 transitions.
[2019-08-04 21:21:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:21:57,818 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:57,818 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:57,818 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash 707062982, now seen corresponding path program 2 times
[2019-08-04 21:21:57,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:57,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:21:57,830 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:57,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:57,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:21:57,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:57,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:57,907 INFO L87 Difference]: Start difference. First operand 291 states and 524 transitions. Second operand 7 states.
[2019-08-04 21:21:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:58,413 INFO L93 Difference]: Finished difference Result 404 states and 718 transitions.
[2019-08-04 21:21:58,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2019-08-04 21:21:58,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:21:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:58,417 INFO L225 Difference]: With dead ends: 404
[2019-08-04 21:21:58,418 INFO L226 Difference]: Without dead ends: 404
[2019-08-04 21:21:58,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2019-08-04 21:21:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states.
[2019-08-04 21:21:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 315.
[2019-08-04 21:21:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states.
[2019-08-04 21:21:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 568 transitions.
[2019-08-04 21:21:58,427 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 568 transitions. Word has length 11
[2019-08-04 21:21:58,427 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:58,427 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 568 transitions.
[2019-08-04 21:21:58,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 568 transitions.
[2019-08-04 21:21:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:21:58,428 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:58,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:58,429 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1106732355, now seen corresponding path program 1 times
[2019-08-04 21:21:58,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:58,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:21:58,440 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:58,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:58,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:21:58,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:58,501 INFO L87 Difference]: Start difference. First operand 315 states and 568 transitions. Second operand 7 states.
[2019-08-04 21:21:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:21:58,993 INFO L93 Difference]: Finished difference Result 378 states and 668 transitions.
[2019-08-04 21:21:58,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2019-08-04 21:21:58,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:21:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:21:58,995 INFO L225 Difference]: With dead ends: 378
[2019-08-04 21:21:58,995 INFO L226 Difference]: Without dead ends: 378
[2019-08-04 21:21:58,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156
[2019-08-04 21:21:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states.
[2019-08-04 21:21:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 301.
[2019-08-04 21:21:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states.
[2019-08-04 21:21:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 541 transitions.
[2019-08-04 21:21:59,004 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 541 transitions. Word has length 11
[2019-08-04 21:21:59,004 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:21:59,004 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 541 transitions.
[2019-08-04 21:21:59,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:21:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 541 transitions.
[2019-08-04 21:21:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:21:59,005 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:21:59,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:21:59,006 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:21:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:21:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times
[2019-08-04 21:21:59,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:21:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:21:59,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:21:59,017 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:21:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:21:59,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:21:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:21:59,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:21:59,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:21:59,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:21:59,487 INFO L87 Difference]: Start difference. First operand 301 states and 541 transitions. Second operand 7 states.
[2019-08-04 21:22:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:01,575 INFO L93 Difference]: Finished difference Result 347 states and 608 transitions.
[2019-08-04 21:22:01,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2019-08-04 21:22:01,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:22:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:01,578 INFO L225 Difference]: With dead ends: 347
[2019-08-04 21:22:01,578 INFO L226 Difference]: Without dead ends: 347
[2019-08-04 21:22:01,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2019-08-04 21:22:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states.
[2019-08-04 21:22:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 279.
[2019-08-04 21:22:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states.
[2019-08-04 21:22:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 499 transitions.
[2019-08-04 21:22:01,586 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 499 transitions. Word has length 11
[2019-08-04 21:22:01,586 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:01,587 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 499 transitions.
[2019-08-04 21:22:01,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 499 transitions.
[2019-08-04 21:22:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:22:01,588 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:01,588 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:01,588 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:01,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1387219104, now seen corresponding path program 1 times
[2019-08-04 21:22:01,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:01,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:22:01,598 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:01,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:01,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:22:01,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:22:01,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:22:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:22:01,708 INFO L87 Difference]: Start difference. First operand 279 states and 499 transitions. Second operand 7 states.
[2019-08-04 21:22:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:02,232 INFO L93 Difference]: Finished difference Result 352 states and 617 transitions.
[2019-08-04 21:22:02,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:22:02,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:22:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:02,235 INFO L225 Difference]: With dead ends: 352
[2019-08-04 21:22:02,236 INFO L226 Difference]: Without dead ends: 352
[2019-08-04 21:22:02,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:22:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states.
[2019-08-04 21:22:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 278.
[2019-08-04 21:22:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states.
[2019-08-04 21:22:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 497 transitions.
[2019-08-04 21:22:02,253 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 497 transitions. Word has length 11
[2019-08-04 21:22:02,253 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:02,253 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 497 transitions.
[2019-08-04 21:22:02,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 497 transitions.
[2019-08-04 21:22:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:22:02,254 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:02,254 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:02,255 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times
[2019-08-04 21:22:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:02,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:22:02,265 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:02,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:02,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:22:02,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:22:02,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:22:02,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:22:02,337 INFO L87 Difference]: Start difference. First operand 278 states and 497 transitions. Second operand 7 states.
[2019-08-04 21:22:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:02,680 INFO L93 Difference]: Finished difference Result 427 states and 757 transitions.
[2019-08-04 21:22:02,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2019-08-04 21:22:02,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:22:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:02,690 INFO L225 Difference]: With dead ends: 427
[2019-08-04 21:22:02,690 INFO L226 Difference]: Without dead ends: 427
[2019-08-04 21:22:02,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2019-08-04 21:22:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states.
[2019-08-04 21:22:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 365.
[2019-08-04 21:22:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states.
[2019-08-04 21:22:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 655 transitions.
[2019-08-04 21:22:02,700 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 655 transitions. Word has length 11
[2019-08-04 21:22:02,700 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:02,700 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 655 transitions.
[2019-08-04 21:22:02,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 655 transitions.
[2019-08-04 21:22:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:22:02,701 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:02,701 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:02,701 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times
[2019-08-04 21:22:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:02,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:22:02,722 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:02,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:22:02,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:22:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:22:02,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:22:02,794 INFO L87 Difference]: Start difference. First operand 365 states and 655 transitions. Second operand 7 states.
[2019-08-04 21:22:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:03,292 INFO L93 Difference]: Finished difference Result 458 states and 809 transitions.
[2019-08-04 21:22:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:22:03,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:22:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:03,295 INFO L225 Difference]: With dead ends: 458
[2019-08-04 21:22:03,295 INFO L226 Difference]: Without dead ends: 458
[2019-08-04 21:22:03,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:22:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states.
[2019-08-04 21:22:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 379.
[2019-08-04 21:22:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states.
[2019-08-04 21:22:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 681 transitions.
[2019-08-04 21:22:03,304 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 681 transitions. Word has length 11
[2019-08-04 21:22:03,304 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:03,304 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 681 transitions.
[2019-08-04 21:22:03,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 681 transitions.
[2019-08-04 21:22:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:22:03,305 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:03,306 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1]
[2019-08-04 21:22:03,306 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1682741169, now seen corresponding path program 2 times
[2019-08-04 21:22:03,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:03,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:22:03,315 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:03,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:03,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:22:03,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:22:03,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:22:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:22:03,412 INFO L87 Difference]: Start difference. First operand 379 states and 681 transitions. Second operand 7 states.
[2019-08-04 21:22:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:03,814 INFO L93 Difference]: Finished difference Result 472 states and 837 transitions.
[2019-08-04 21:22:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2019-08-04 21:22:03,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:22:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:03,818 INFO L225 Difference]: With dead ends: 472
[2019-08-04 21:22:03,818 INFO L226 Difference]: Without dead ends: 472
[2019-08-04 21:22:03,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240
[2019-08-04 21:22:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states.
[2019-08-04 21:22:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 412.
[2019-08-04 21:22:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states.
[2019-08-04 21:22:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 739 transitions.
[2019-08-04 21:22:03,828 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 739 transitions. Word has length 11
[2019-08-04 21:22:03,828 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:03,828 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 739 transitions.
[2019-08-04 21:22:03,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 739 transitions.
[2019-08-04 21:22:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:22:03,829 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:03,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:03,829 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:03,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:03,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times
[2019-08-04 21:22:03,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:03,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:22:03,837 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:03,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:03,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:22:03,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:22:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:22:03,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:22:03,957 INFO L87 Difference]: Start difference. First operand 412 states and 739 transitions. Second operand 7 states.
[2019-08-04 21:22:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:04,228 INFO L93 Difference]: Finished difference Result 447 states and 785 transitions.
[2019-08-04 21:22:04,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2019-08-04 21:22:04,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:22:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:04,231 INFO L225 Difference]: With dead ends: 447
[2019-08-04 21:22:04,231 INFO L226 Difference]: Without dead ends: 447
[2019-08-04 21:22:04,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2019-08-04 21:22:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states.
[2019-08-04 21:22:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 400.
[2019-08-04 21:22:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states.
[2019-08-04 21:22:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 713 transitions.
[2019-08-04 21:22:04,240 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 713 transitions. Word has length 11
[2019-08-04 21:22:04,240 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:04,240 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 713 transitions.
[2019-08-04 21:22:04,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 713 transitions.
[2019-08-04 21:22:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:22:04,241 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:04,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:04,242 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1918663185, now seen corresponding path program 1 times
[2019-08-04 21:22:04,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:04,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:22:04,250 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:04,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:04,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:22:04,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:22:04,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:22:04,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:22:04,611 INFO L87 Difference]: Start difference. First operand 400 states and 713 transitions. Second operand 7 states.
[2019-08-04 21:22:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:05,026 INFO L93 Difference]: Finished difference Result 461 states and 809 transitions.
[2019-08-04 21:22:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2019-08-04 21:22:05,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:22:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:05,032 INFO L225 Difference]: With dead ends: 461
[2019-08-04 21:22:05,032 INFO L226 Difference]: Without dead ends: 461
[2019-08-04 21:22:05,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156
[2019-08-04 21:22:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states.
[2019-08-04 21:22:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 372.
[2019-08-04 21:22:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states.
[2019-08-04 21:22:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 663 transitions.
[2019-08-04 21:22:05,040 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 663 transitions. Word has length 11
[2019-08-04 21:22:05,040 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:05,040 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 663 transitions.
[2019-08-04 21:22:05,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 663 transitions.
[2019-08-04 21:22:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-08-04 21:22:05,041 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:05,041 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:05,041 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times
[2019-08-04 21:22:05,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:05,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-08-04 21:22:05,049 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:05,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:05,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2019-08-04 21:22:05,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:22:05,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:22:05,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:22:05,158 INFO L87 Difference]: Start difference. First operand 372 states and 663 transitions. Second operand 7 states.
[2019-08-04 21:22:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:05,436 INFO L93 Difference]: Finished difference Result 438 states and 767 transitions.
[2019-08-04 21:22:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:22:05,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2019-08-04 21:22:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:05,439 INFO L225 Difference]: With dead ends: 438
[2019-08-04 21:22:05,439 INFO L226 Difference]: Without dead ends: 438
[2019-08-04 21:22:05,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:22:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states.
[2019-08-04 21:22:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 364.
[2019-08-04 21:22:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states.
[2019-08-04 21:22:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 647 transitions.
[2019-08-04 21:22:05,447 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 647 transitions. Word has length 11
[2019-08-04 21:22:05,447 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:05,447 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 647 transitions.
[2019-08-04 21:22:05,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 647 transitions.
[2019-08-04 21:22:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2019-08-04 21:22:05,448 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:05,448 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:05,449 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash -54183977, now seen corresponding path program 1 times
[2019-08-04 21:22:05,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:05,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:05,457 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:05,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:05,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:05,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:05,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:05,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:05,632 INFO L87 Difference]: Start difference. First operand 364 states and 647 transitions. Second operand 9 states.
[2019-08-04 21:22:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:06,064 INFO L93 Difference]: Finished difference Result 542 states and 969 transitions.
[2019-08-04 21:22:06,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2019-08-04 21:22:06,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2019-08-04 21:22:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:06,067 INFO L225 Difference]: With dead ends: 542
[2019-08-04 21:22:06,067 INFO L226 Difference]: Without dead ends: 542
[2019-08-04 21:22:06,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380
[2019-08-04 21:22:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states.
[2019-08-04 21:22:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 273.
[2019-08-04 21:22:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states.
[2019-08-04 21:22:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 483 transitions.
[2019-08-04 21:22:06,074 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 483 transitions. Word has length 12
[2019-08-04 21:22:06,074 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:06,074 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 483 transitions.
[2019-08-04 21:22:06,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 483 transitions.
[2019-08-04 21:22:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2019-08-04 21:22:06,075 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:06,075 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:06,075 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:06,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times
[2019-08-04 21:22:06,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:06,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:06,084 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:06,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:06,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:06,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:06,182 INFO L87 Difference]: Start difference. First operand 273 states and 483 transitions. Second operand 9 states.
[2019-08-04 21:22:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:06,590 INFO L93 Difference]: Finished difference Result 373 states and 662 transitions.
[2019-08-04 21:22:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2019-08-04 21:22:06,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2019-08-04 21:22:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:06,593 INFO L225 Difference]: With dead ends: 373
[2019-08-04 21:22:06,593 INFO L226 Difference]: Without dead ends: 373
[2019-08-04 21:22:06,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380
[2019-08-04 21:22:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states.
[2019-08-04 21:22:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 186.
[2019-08-04 21:22:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states.
[2019-08-04 21:22:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 327 transitions.
[2019-08-04 21:22:06,598 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 327 transitions. Word has length 12
[2019-08-04 21:22:06,598 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:06,598 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 327 transitions.
[2019-08-04 21:22:06,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 327 transitions.
[2019-08-04 21:22:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:06,599 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:06,599 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2019-08-04 21:22:06,600 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times
[2019-08-04 21:22:06,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:06,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:06,609 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:06,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:06,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:06,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:06,704 INFO L87 Difference]: Start difference. First operand 186 states and 327 transitions. Second operand 9 states.
[2019-08-04 21:22:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:07,160 INFO L93 Difference]: Finished difference Result 313 states and 542 transitions.
[2019-08-04 21:22:07,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2019-08-04 21:22:07,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:07,162 INFO L225 Difference]: With dead ends: 313
[2019-08-04 21:22:07,162 INFO L226 Difference]: Without dead ends: 313
[2019-08-04 21:22:07,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380
[2019-08-04 21:22:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states.
[2019-08-04 21:22:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 205.
[2019-08-04 21:22:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states.
[2019-08-04 21:22:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 362 transitions.
[2019-08-04 21:22:07,167 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 362 transitions. Word has length 15
[2019-08-04 21:22:07,167 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:07,167 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 362 transitions.
[2019-08-04 21:22:07,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 362 transitions.
[2019-08-04 21:22:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:07,168 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:07,168 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2019-08-04 21:22:07,168 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:07,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:07,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1863284942, now seen corresponding path program 2 times
[2019-08-04 21:22:07,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:07,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:07,177 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:07,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:07,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:07,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:07,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:07,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:07,323 INFO L87 Difference]: Start difference. First operand 205 states and 362 transitions. Second operand 9 states.
[2019-08-04 21:22:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:07,840 INFO L93 Difference]: Finished difference Result 273 states and 470 transitions.
[2019-08-04 21:22:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2019-08-04 21:22:07,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:07,842 INFO L225 Difference]: With dead ends: 273
[2019-08-04 21:22:07,842 INFO L226 Difference]: Without dead ends: 273
[2019-08-04 21:22:07,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462
[2019-08-04 21:22:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2019-08-04 21:22:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 217.
[2019-08-04 21:22:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states.
[2019-08-04 21:22:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 385 transitions.
[2019-08-04 21:22:07,847 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 385 transitions. Word has length 15
[2019-08-04 21:22:07,847 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:07,847 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 385 transitions.
[2019-08-04 21:22:07,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 385 transitions.
[2019-08-04 21:22:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:07,848 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:07,849 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:07,849 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:07,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1871873111, now seen corresponding path program 1 times
[2019-08-04 21:22:07,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:07,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core
[2019-08-04 21:22:07,857 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:07,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:07,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2019-08-04 21:22:07,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:07,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:07,996 INFO L87 Difference]: Start difference. First operand 217 states and 385 transitions. Second operand 9 states.
[2019-08-04 21:22:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:08,671 INFO L93 Difference]: Finished difference Result 266 states and 459 transitions.
[2019-08-04 21:22:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2019-08-04 21:22:08,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:08,673 INFO L225 Difference]: With dead ends: 266
[2019-08-04 21:22:08,673 INFO L226 Difference]: Without dead ends: 266
[2019-08-04 21:22:08,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240
[2019-08-04 21:22:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2019-08-04 21:22:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 225.
[2019-08-04 21:22:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states.
[2019-08-04 21:22:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 400 transitions.
[2019-08-04 21:22:08,678 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 400 transitions. Word has length 15
[2019-08-04 21:22:08,678 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:08,678 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 400 transitions.
[2019-08-04 21:22:08,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 400 transitions.
[2019-08-04 21:22:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:08,679 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:08,679 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2019-08-04 21:22:08,679 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash 718510768, now seen corresponding path program 3 times
[2019-08-04 21:22:08,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:08,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:08,687 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:08,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:08,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:08,775 INFO L87 Difference]: Start difference. First operand 225 states and 400 transitions. Second operand 9 states.
[2019-08-04 21:22:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:09,283 INFO L93 Difference]: Finished difference Result 273 states and 474 transitions.
[2019-08-04 21:22:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2019-08-04 21:22:09,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:09,286 INFO L225 Difference]: With dead ends: 273
[2019-08-04 21:22:09,286 INFO L226 Difference]: Without dead ends: 273
[2019-08-04 21:22:09,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420
[2019-08-04 21:22:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2019-08-04 21:22:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 210.
[2019-08-04 21:22:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states.
[2019-08-04 21:22:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions.
[2019-08-04 21:22:09,291 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 15
[2019-08-04 21:22:09,291 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:09,291 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions.
[2019-08-04 21:22:09,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions.
[2019-08-04 21:22:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:09,292 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:09,292 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:09,292 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 727098937, now seen corresponding path program 2 times
[2019-08-04 21:22:09,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:09,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core
[2019-08-04 21:22:09,299 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:09,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:09,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2019-08-04 21:22:09,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:09,553 INFO L87 Difference]: Start difference. First operand 210 states and 372 transitions. Second operand 9 states.
[2019-08-04 21:22:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:10,657 INFO L93 Difference]: Finished difference Result 307 states and 521 transitions.
[2019-08-04 21:22:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2019-08-04 21:22:10,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:10,660 INFO L225 Difference]: With dead ends: 307
[2019-08-04 21:22:10,660 INFO L226 Difference]: Without dead ends: 307
[2019-08-04 21:22:10,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380
[2019-08-04 21:22:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states.
[2019-08-04 21:22:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 227.
[2019-08-04 21:22:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states.
[2019-08-04 21:22:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 403 transitions.
[2019-08-04 21:22:10,665 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 403 transitions. Word has length 15
[2019-08-04 21:22:10,665 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:10,666 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 403 transitions.
[2019-08-04 21:22:10,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 403 transitions.
[2019-08-04 21:22:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:10,666 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:10,666 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:10,667 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1120804793, now seen corresponding path program 3 times
[2019-08-04 21:22:10,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:10,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core
[2019-08-04 21:22:10,676 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:10,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:10,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2019-08-04 21:22:10,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:10,921 INFO L87 Difference]: Start difference. First operand 227 states and 403 transitions. Second operand 9 states.
[2019-08-04 21:22:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:11,584 INFO L93 Difference]: Finished difference Result 305 states and 531 transitions.
[2019-08-04 21:22:11,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2019-08-04 21:22:11,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:11,585 INFO L225 Difference]: With dead ends: 305
[2019-08-04 21:22:11,585 INFO L226 Difference]: Without dead ends: 305
[2019-08-04 21:22:11,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462
[2019-08-04 21:22:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2019-08-04 21:22:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 237.
[2019-08-04 21:22:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states.
[2019-08-04 21:22:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 421 transitions.
[2019-08-04 21:22:11,590 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 421 transitions. Word has length 15
[2019-08-04 21:22:11,590 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:11,590 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 421 transitions.
[2019-08-04 21:22:11,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 421 transitions.
[2019-08-04 21:22:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:11,591 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:11,591 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:11,592 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -21431298, now seen corresponding path program 1 times
[2019-08-04 21:22:11,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:11,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:11,599 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:11,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:11,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:11,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:11,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:11,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:11,704 INFO L87 Difference]: Start difference. First operand 237 states and 421 transitions. Second operand 9 states.
[2019-08-04 21:22:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:12,060 INFO L93 Difference]: Finished difference Result 363 states and 636 transitions.
[2019-08-04 21:22:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2019-08-04 21:22:12,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:12,064 INFO L225 Difference]: With dead ends: 363
[2019-08-04 21:22:12,064 INFO L226 Difference]: Without dead ends: 363
[2019-08-04 21:22:12,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272
[2019-08-04 21:22:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states.
[2019-08-04 21:22:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 200.
[2019-08-04 21:22:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states.
[2019-08-04 21:22:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 352 transitions.
[2019-08-04 21:22:12,069 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 352 transitions. Word has length 15
[2019-08-04 21:22:12,069 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:12,069 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 352 transitions.
[2019-08-04 21:22:12,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 352 transitions.
[2019-08-04 21:22:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:12,070 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:12,070 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:12,070 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:12,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash -185535140, now seen corresponding path program 2 times
[2019-08-04 21:22:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:12,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:12,077 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:12,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:12,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:12,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:12,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:12,182 INFO L87 Difference]: Start difference. First operand 200 states and 352 transitions. Second operand 9 states.
[2019-08-04 21:22:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:12,578 INFO L93 Difference]: Finished difference Result 319 states and 554 transitions.
[2019-08-04 21:22:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2019-08-04 21:22:12,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:12,580 INFO L225 Difference]: With dead ends: 319
[2019-08-04 21:22:12,580 INFO L226 Difference]: Without dead ends: 319
[2019-08-04 21:22:12,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272
[2019-08-04 21:22:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states.
[2019-08-04 21:22:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 167.
[2019-08-04 21:22:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states.
[2019-08-04 21:22:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 288 transitions.
[2019-08-04 21:22:12,585 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 288 transitions. Word has length 15
[2019-08-04 21:22:12,585 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:12,586 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 288 transitions.
[2019-08-04 21:22:12,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 288 transitions.
[2019-08-04 21:22:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:12,586 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:12,587 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:12,587 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:12,587 INFO L82 PathProgramCache]: Analyzing trace with hash -176946971, now seen corresponding path program 1 times
[2019-08-04 21:22:12,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:12,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core
[2019-08-04 21:22:12,594 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:12,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:12,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2019-08-04 21:22:12,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:12,748 INFO L87 Difference]: Start difference. First operand 167 states and 288 transitions. Second operand 9 states.
[2019-08-04 21:22:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:13,301 INFO L93 Difference]: Finished difference Result 203 states and 334 transitions.
[2019-08-04 21:22:13,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:22:13,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:13,303 INFO L225 Difference]: With dead ends: 203
[2019-08-04 21:22:13,303 INFO L226 Difference]: Without dead ends: 203
[2019-08-04 21:22:13,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2019-08-04 21:22:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states.
[2019-08-04 21:22:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 152.
[2019-08-04 21:22:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2019-08-04 21:22:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 260 transitions.
[2019-08-04 21:22:13,307 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 260 transitions. Word has length 15
[2019-08-04 21:22:13,307 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:13,307 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 260 transitions.
[2019-08-04 21:22:13,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 260 transitions.
[2019-08-04 21:22:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:13,308 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:13,308 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:13,308 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times
[2019-08-04 21:22:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:13,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:13,315 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:13,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:13,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:13,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:13,426 INFO L87 Difference]: Start difference. First operand 152 states and 260 transitions. Second operand 9 states.
[2019-08-04 21:22:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:13,944 INFO L93 Difference]: Finished difference Result 193 states and 333 transitions.
[2019-08-04 21:22:13,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2019-08-04 21:22:13,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:13,946 INFO L225 Difference]: With dead ends: 193
[2019-08-04 21:22:13,946 INFO L226 Difference]: Without dead ends: 193
[2019-08-04 21:22:13,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272
[2019-08-04 21:22:13,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2019-08-04 21:22:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146.
[2019-08-04 21:22:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2019-08-04 21:22:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 249 transitions.
[2019-08-04 21:22:13,950 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 249 transitions. Word has length 15
[2019-08-04 21:22:13,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:13,950 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 249 transitions.
[2019-08-04 21:22:13,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 249 transitions.
[2019-08-04 21:22:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:13,951 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:13,951 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:13,951 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1949120374, now seen corresponding path program 2 times
[2019-08-04 21:22:13,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:13,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:13,958 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:14,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:14,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:14,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:14,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:14,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:14,013 INFO L87 Difference]: Start difference. First operand 146 states and 249 transitions. Second operand 9 states.
[2019-08-04 21:22:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:14,533 INFO L93 Difference]: Finished difference Result 193 states and 328 transitions.
[2019-08-04 21:22:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2019-08-04 21:22:14,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:14,535 INFO L225 Difference]: With dead ends: 193
[2019-08-04 21:22:14,535 INFO L226 Difference]: Without dead ends: 193
[2019-08-04 21:22:14,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380
[2019-08-04 21:22:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2019-08-04 21:22:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146.
[2019-08-04 21:22:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2019-08-04 21:22:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 248 transitions.
[2019-08-04 21:22:14,539 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 248 transitions. Word has length 15
[2019-08-04 21:22:14,539 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:14,539 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 248 transitions.
[2019-08-04 21:22:14,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 248 transitions.
[2019-08-04 21:22:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:14,540 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:14,540 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2019-08-04 21:22:14,540 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times
[2019-08-04 21:22:14,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:14,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:14,546 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:14,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:14,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:14,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:14,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:14,613 INFO L87 Difference]: Start difference. First operand 146 states and 248 transitions. Second operand 9 states.
[2019-08-04 21:22:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:15,193 INFO L93 Difference]: Finished difference Result 197 states and 336 transitions.
[2019-08-04 21:22:15,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2019-08-04 21:22:15,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:15,195 INFO L225 Difference]: With dead ends: 197
[2019-08-04 21:22:15,195 INFO L226 Difference]: Without dead ends: 197
[2019-08-04 21:22:15,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420
[2019-08-04 21:22:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states.
[2019-08-04 21:22:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 133.
[2019-08-04 21:22:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states.
[2019-08-04 21:22:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 227 transitions.
[2019-08-04 21:22:15,198 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 227 transitions. Word has length 15
[2019-08-04 21:22:15,198 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:15,198 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 227 transitions.
[2019-08-04 21:22:15,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 227 transitions.
[2019-08-04 21:22:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:15,199 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:15,199 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:15,199 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:15,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1652283980, now seen corresponding path program 1 times
[2019-08-04 21:22:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:15,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:15,206 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:15,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:15,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:15,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:15,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:15,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:15,282 INFO L87 Difference]: Start difference. First operand 133 states and 227 transitions. Second operand 9 states.
[2019-08-04 21:22:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:15,692 INFO L93 Difference]: Finished difference Result 175 states and 295 transitions.
[2019-08-04 21:22:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:22:15,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:15,693 INFO L225 Difference]: With dead ends: 175
[2019-08-04 21:22:15,694 INFO L226 Difference]: Without dead ends: 175
[2019-08-04 21:22:15,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306
[2019-08-04 21:22:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2019-08-04 21:22:15,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 143.
[2019-08-04 21:22:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states.
[2019-08-04 21:22:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 244 transitions.
[2019-08-04 21:22:15,697 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 244 transitions. Word has length 15
[2019-08-04 21:22:15,697 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:15,697 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 244 transitions.
[2019-08-04 21:22:15,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 244 transitions.
[2019-08-04 21:22:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:15,698 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:15,698 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:15,698 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1643695811, now seen corresponding path program 1 times
[2019-08-04 21:22:15,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:15,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:15,704 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:15,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:15,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:15,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:15,854 INFO L87 Difference]: Start difference. First operand 143 states and 244 transitions. Second operand 9 states.
[2019-08-04 21:22:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:16,381 INFO L93 Difference]: Finished difference Result 186 states and 315 transitions.
[2019-08-04 21:22:16,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2019-08-04 21:22:16,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:16,383 INFO L225 Difference]: With dead ends: 186
[2019-08-04 21:22:16,384 INFO L226 Difference]: Without dead ends: 186
[2019-08-04 21:22:16,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462
[2019-08-04 21:22:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2019-08-04 21:22:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 138.
[2019-08-04 21:22:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states.
[2019-08-04 21:22:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 236 transitions.
[2019-08-04 21:22:16,387 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 236 transitions. Word has length 15
[2019-08-04 21:22:16,387 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:16,387 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 236 transitions.
[2019-08-04 21:22:16,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 236 transitions.
[2019-08-04 21:22:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:16,388 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:16,388 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:16,388 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:16,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:16,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1603552790, now seen corresponding path program 1 times
[2019-08-04 21:22:16,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:16,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:16,394 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:16,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:16,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:16,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:16,812 INFO L87 Difference]: Start difference. First operand 138 states and 236 transitions. Second operand 9 states.
[2019-08-04 21:22:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:17,324 INFO L93 Difference]: Finished difference Result 200 states and 342 transitions.
[2019-08-04 21:22:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2019-08-04 21:22:17,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:17,326 INFO L225 Difference]: With dead ends: 200
[2019-08-04 21:22:17,326 INFO L226 Difference]: Without dead ends: 200
[2019-08-04 21:22:17,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380
[2019-08-04 21:22:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2019-08-04 21:22:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 133.
[2019-08-04 21:22:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states.
[2019-08-04 21:22:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 227 transitions.
[2019-08-04 21:22:17,331 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 227 transitions. Word has length 15
[2019-08-04 21:22:17,331 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:17,331 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 227 transitions.
[2019-08-04 21:22:17,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 227 transitions.
[2019-08-04 21:22:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:17,332 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:17,332 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:17,332 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:17,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash -38294824, now seen corresponding path program 2 times
[2019-08-04 21:22:17,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:17,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:17,341 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:17,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:17,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:17,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:17,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:17,431 INFO L87 Difference]: Start difference. First operand 133 states and 227 transitions. Second operand 9 states.
[2019-08-04 21:22:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:17,828 INFO L93 Difference]: Finished difference Result 202 states and 347 transitions.
[2019-08-04 21:22:17,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2019-08-04 21:22:17,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:17,830 INFO L225 Difference]: With dead ends: 202
[2019-08-04 21:22:17,830 INFO L226 Difference]: Without dead ends: 202
[2019-08-04 21:22:17,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240
[2019-08-04 21:22:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2019-08-04 21:22:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 127.
[2019-08-04 21:22:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states.
[2019-08-04 21:22:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 218 transitions.
[2019-08-04 21:22:17,834 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 218 transitions. Word has length 15
[2019-08-04 21:22:17,834 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:17,834 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 218 transitions.
[2019-08-04 21:22:17,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 218 transitions.
[2019-08-04 21:22:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:17,834 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:17,835 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:17,835 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash -29706655, now seen corresponding path program 2 times
[2019-08-04 21:22:17,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:17,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:17,841 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:18,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:18,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:18,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:18,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:18,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:18,173 INFO L87 Difference]: Start difference. First operand 127 states and 218 transitions. Second operand 9 states.
[2019-08-04 21:22:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:18,736 INFO L93 Difference]: Finished difference Result 212 states and 365 transitions.
[2019-08-04 21:22:18,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2019-08-04 21:22:18,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:18,738 INFO L225 Difference]: With dead ends: 212
[2019-08-04 21:22:18,738 INFO L226 Difference]: Without dead ends: 212
[2019-08-04 21:22:18,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272
[2019-08-04 21:22:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2019-08-04 21:22:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 111.
[2019-08-04 21:22:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states.
[2019-08-04 21:22:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions.
[2019-08-04 21:22:18,741 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 15
[2019-08-04 21:22:18,742 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:18,742 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions.
[2019-08-04 21:22:18,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions.
[2019-08-04 21:22:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-08-04 21:22:18,742 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:18,742 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:18,742 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:18,743 INFO L82 PathProgramCache]: Analyzing trace with hash 10436366, now seen corresponding path program 2 times
[2019-08-04 21:22:18,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:18,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-08-04 21:22:18,749 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:18,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:18,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:18,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-08-04 21:22:18,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-08-04 21:22:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2019-08-04 21:22:18,839 INFO L87 Difference]: Start difference. First operand 111 states and 189 transitions. Second operand 9 states.
[2019-08-04 21:22:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:19,188 INFO L93 Difference]: Finished difference Result 160 states and 273 transitions.
[2019-08-04 21:22:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2019-08-04 21:22:19,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2019-08-04 21:22:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:19,190 INFO L225 Difference]: With dead ends: 160
[2019-08-04 21:22:19,190 INFO L226 Difference]: Without dead ends: 160
[2019-08-04 21:22:19,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272
[2019-08-04 21:22:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2019-08-04 21:22:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 61.
[2019-08-04 21:22:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2019-08-04 21:22:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 99 transitions.
[2019-08-04 21:22:19,193 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 99 transitions. Word has length 15
[2019-08-04 21:22:19,193 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:19,193 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 99 transitions.
[2019-08-04 21:22:19,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-08-04 21:22:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 99 transitions.
[2019-08-04 21:22:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-08-04 21:22:19,193 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:19,193 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:19,194 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:19,194 INFO L82 PathProgramCache]: Analyzing trace with hash -322212234, now seen corresponding path program 4 times
[2019-08-04 21:22:19,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:19,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core
[2019-08-04 21:22:19,203 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:19,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:19,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2019-08-04 21:22:19,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-08-04 21:22:19,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-08-04 21:22:19,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2019-08-04 21:22:19,400 INFO L87 Difference]: Start difference. First operand 61 states and 99 transitions. Second operand 11 states.
[2019-08-04 21:22:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:20,223 INFO L93 Difference]: Finished difference Result 132 states and 211 transitions.
[2019-08-04 21:22:20,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2019-08-04 21:22:20,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19
[2019-08-04 21:22:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:20,225 INFO L225 Difference]: With dead ends: 132
[2019-08-04 21:22:20,225 INFO L226 Difference]: Without dead ends: 132
[2019-08-04 21:22:20,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420
[2019-08-04 21:22:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2019-08-04 21:22:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 76.
[2019-08-04 21:22:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states.
[2019-08-04 21:22:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 126 transitions.
[2019-08-04 21:22:20,228 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 126 transitions. Word has length 19
[2019-08-04 21:22:20,229 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:20,229 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 126 transitions.
[2019-08-04 21:22:20,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-08-04 21:22:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 126 transitions.
[2019-08-04 21:22:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-08-04 21:22:20,229 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:20,229 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:20,230 INFO L418 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash 67620696, now seen corresponding path program 5 times
[2019-08-04 21:22:20,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:20,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core
[2019-08-04 21:22:20,239 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:20,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:20,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2019-08-04 21:22:20,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-08-04 21:22:20,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-08-04 21:22:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2019-08-04 21:22:20,413 INFO L87 Difference]: Start difference. First operand 76 states and 126 transitions. Second operand 11 states.
[2019-08-04 21:22:21,166 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 25
[2019-08-04 21:22:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:21,843 INFO L93 Difference]: Finished difference Result 121 states and 197 transitions.
[2019-08-04 21:22:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2019-08-04 21:22:21,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19
[2019-08-04 21:22:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:21,845 INFO L225 Difference]: With dead ends: 121
[2019-08-04 21:22:21,845 INFO L226 Difference]: Without dead ends: 121
[2019-08-04 21:22:21,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462
[2019-08-04 21:22:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2019-08-04 21:22:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 67.
[2019-08-04 21:22:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2019-08-04 21:22:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 110 transitions.
[2019-08-04 21:22:21,847 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 110 transitions. Word has length 19
[2019-08-04 21:22:21,847 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:21,847 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 110 transitions.
[2019-08-04 21:22:21,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-08-04 21:22:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 110 transitions.
[2019-08-04 21:22:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-08-04 21:22:21,848 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:21,848 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:21,848 INFO L418 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1077153478, now seen corresponding path program 6 times
[2019-08-04 21:22:21,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:21,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core
[2019-08-04 21:22:21,856 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:21,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:21,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2019-08-04 21:22:21,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-08-04 21:22:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-08-04 21:22:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2019-08-04 21:22:21,959 INFO L87 Difference]: Start difference. First operand 67 states and 110 transitions. Second operand 11 states.
[2019-08-04 21:22:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:23,970 INFO L93 Difference]: Finished difference Result 109 states and 181 transitions.
[2019-08-04 21:22:23,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2019-08-04 21:22:23,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19
[2019-08-04 21:22:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:23,971 INFO L225 Difference]: With dead ends: 109
[2019-08-04 21:22:23,971 INFO L226 Difference]: Without dead ends: 109
[2019-08-04 21:22:23,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552
[2019-08-04 21:22:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2019-08-04 21:22:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63.
[2019-08-04 21:22:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2019-08-04 21:22:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 103 transitions.
[2019-08-04 21:22:23,974 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 103 transitions. Word has length 19
[2019-08-04 21:22:23,974 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:23,974 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 103 transitions.
[2019-08-04 21:22:23,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-08-04 21:22:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 103 transitions.
[2019-08-04 21:22:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-08-04 21:22:23,975 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:23,975 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:23,975 INFO L418 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1369910088, now seen corresponding path program 7 times
[2019-08-04 21:22:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:23,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core
[2019-08-04 21:22:23,982 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:24,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2019-08-04 21:22:24,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-08-04 21:22:24,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-08-04 21:22:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=88, Unknown=1, NotChecked=0, Total=110
[2019-08-04 21:22:24,488 INFO L87 Difference]: Start difference. First operand 63 states and 103 transitions. Second operand 11 states.
[2019-08-04 21:22:29,148 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 30
[2019-08-04 21:22:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:33,371 INFO L93 Difference]: Finished difference Result 102 states and 171 transitions.
[2019-08-04 21:22:33,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2019-08-04 21:22:33,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19
[2019-08-04 21:22:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:33,372 INFO L225 Difference]: With dead ends: 102
[2019-08-04 21:22:33,373 INFO L226 Difference]: Without dead ends: 102
[2019-08-04 21:22:33,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=109, Invalid=301, Unknown=10, NotChecked=0, Total=420
[2019-08-04 21:22:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2019-08-04 21:22:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71.
[2019-08-04 21:22:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states.
[2019-08-04 21:22:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 117 transitions.
[2019-08-04 21:22:33,376 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 117 transitions. Word has length 19
[2019-08-04 21:22:33,376 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:33,376 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 117 transitions.
[2019-08-04 21:22:33,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-08-04 21:22:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 117 transitions.
[2019-08-04 21:22:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-08-04 21:22:33,377 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:33,377 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-08-04 21:22:33,377 INFO L418 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1969222660, now seen corresponding path program 2 times
[2019-08-04 21:22:33,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:33,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core
[2019-08-04 21:22:33,384 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:33,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:33,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2019-08-04 21:22:33,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-08-04 21:22:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-08-04 21:22:33,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2019-08-04 21:22:33,501 INFO L87 Difference]: Start difference. First operand 71 states and 117 transitions. Second operand 11 states.
[2019-08-04 21:22:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:34,146 INFO L93 Difference]: Finished difference Result 91 states and 147 transitions.
[2019-08-04 21:22:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-08-04 21:22:34,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19
[2019-08-04 21:22:34,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:34,148 INFO L225 Difference]: With dead ends: 91
[2019-08-04 21:22:34,148 INFO L226 Difference]: Without dead ends: 91
[2019-08-04 21:22:34,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306
[2019-08-04 21:22:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2019-08-04 21:22:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52.
[2019-08-04 21:22:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2019-08-04 21:22:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions.
[2019-08-04 21:22:34,151 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 19
[2019-08-04 21:22:34,151 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:34,151 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions.
[2019-08-04 21:22:34,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-08-04 21:22:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions.
[2019-08-04 21:22:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-08-04 21:22:34,151 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:34,151 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1]
[2019-08-04 21:22:34,151 INFO L418 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash 212255361, now seen corresponding path program 8 times
[2019-08-04 21:22:34,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:34,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core
[2019-08-04 21:22:34,159 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2019-08-04 21:22:34,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2019-08-04 21:22:34,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-08-04 21:22:34,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-08-04 21:22:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-08-04 21:22:34,303 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand 7 states.
[2019-08-04 21:22:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:34,444 INFO L93 Difference]: Finished difference Result 155 states and 241 transitions.
[2019-08-04 21:22:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2019-08-04 21:22:34,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2019-08-04 21:22:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:34,446 INFO L225 Difference]: With dead ends: 155
[2019-08-04 21:22:34,446 INFO L226 Difference]: Without dead ends: 155
[2019-08-04 21:22:34,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2019-08-04 21:22:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2019-08-04 21:22:34,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124.
[2019-08-04 21:22:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states.
[2019-08-04 21:22:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 198 transitions.
[2019-08-04 21:22:34,449 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 198 transitions. Word has length 22
[2019-08-04 21:22:34,449 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:34,449 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 198 transitions.
[2019-08-04 21:22:34,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-08-04 21:22:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 198 transitions.
[2019-08-04 21:22:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-08-04 21:22:34,450 INFO L391 BasicCegarLoop]: Found error trace
[2019-08-04 21:22:34,450 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1]
[2019-08-04 21:22:34,450 INFO L418 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]===
[2019-08-04 21:22:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-08-04 21:22:34,450 INFO L82 PathProgramCache]: Analyzing trace with hash 454456195, now seen corresponding path program 1 times
[2019-08-04 21:22:34,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2019-08-04 21:22:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-08-04 21:22:34,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core
[2019-08-04 21:22:34,458 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-08-04 21:22:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-08-04 21:22:36,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2019-08-04 21:22:36,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2019-08-04 21:22:36,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states
[2019-08-04 21:22:36,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2019-08-04 21:22:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=106, Unknown=3, NotChecked=0, Total=132
[2019-08-04 21:22:36,270 INFO L87 Difference]: Start difference. First operand 124 states and 198 transitions. Second operand 12 states.
[2019-08-04 21:22:39,403 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 30
[2019-08-04 21:22:43,097 WARN L188 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 32
[2019-08-04 21:22:46,494 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32
[2019-08-04 21:22:47,165 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 40
[2019-08-04 21:22:49,230 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 38
[2019-08-04 21:22:50,060 WARN L188 SmtUtils]: Spent 767.00 ms on a formula simplification that was a NOOP. DAG size: 45
[2019-08-04 21:22:51,898 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 39
[2019-08-04 21:22:53,354 WARN L188 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 41
[2019-08-04 21:22:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-08-04 21:22:53,502 INFO L93 Difference]: Finished difference Result 198 states and 330 transitions.
[2019-08-04 21:22:53,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2019-08-04 21:22:53,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22
[2019-08-04 21:22:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-08-04 21:22:53,503 INFO L225 Difference]: With dead ends: 198
[2019-08-04 21:22:53,503 INFO L226 Difference]: Without dead ends: 0
[2019-08-04 21:22:53,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=196, Invalid=442, Unknown=12, NotChecked=0, Total=650
[2019-08-04 21:22:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-08-04 21:22:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-08-04 21:22:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-08-04 21:22:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-08-04 21:22:53,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22
[2019-08-04 21:22:53,505 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-08-04 21:22:53,505 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-08-04 21:22:53,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2019-08-04 21:22:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-08-04 21:22:53,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-08-04 21:22:53,510 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:22:53 BoogieIcfgContainer
[2019-08-04 21:22:53,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-08-04 21:22:53,512 INFO L168 Benchmark]: Toolchain (without parser) took 65546.06 ms. Allocated memory was 140.0 MB in the beginning and 394.8 MB in the end (delta: 254.8 MB). Free memory was 108.7 MB in the beginning and 283.5 MB in the end (delta: -174.8 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB.
[2019-08-04 21:22:53,513 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB.
[2019-08-04 21:22:53,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.60 ms. Allocated memory is still 140.0 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB.
[2019-08-04 21:22:53,514 INFO L168 Benchmark]: Boogie Preprocessor took 25.23 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB.
[2019-08-04 21:22:53,514 INFO L168 Benchmark]: RCFGBuilder took 441.92 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 93.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB.
[2019-08-04 21:22:53,515 INFO L168 Benchmark]: TraceAbstraction took 65036.54 ms. Allocated memory was 140.0 MB in the beginning and 394.8 MB in the end (delta: 254.8 MB). Free memory was 93.3 MB in the beginning and 283.5 MB in the end (delta: -190.3 MB). Peak memory consumption was 64.6 MB. Max. memory is 7.1 GB.
[2019-08-04 21:22:53,518 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.23 ms. Allocated memory is still 140.0 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 37.60 ms. Allocated memory is still 140.0 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 25.23 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 441.92 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 93.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 65036.54 ms. Allocated memory was 140.0 MB in the beginning and 394.8 MB in the end (delta: 254.8 MB). Free memory was 93.3 MB in the beginning and 283.5 MB in the end (delta: -190.3 MB). Peak memory consumption was 64.6 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 37]: assertion always holds
For all program executions holds that assertion always holds at this location
- PositiveResult [Line: 78]: assertion always holds
For all program executions holds that assertion always holds at this location
- PositiveResult [Line: 69]: assertion always holds
For all program executions holds that assertion always holds at this location
- PositiveResult [Line: 58]: assertion always holds
For all program executions holds that assertion always holds at this location
- AllSpecificationsHoldResult: All specifications hold
4 specifications checked. All of them hold
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 18 locations, 4 error locations. SAFE Result, 64.9s OverallTime, 50 OverallIterations, 3 TraceHistogramMax, 54.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1644 SDtfs, 3959 SDslu, 3335 SDs, 0 SdLazy, 16182 SolverSat, 1216 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 28.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1007 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 723 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 31.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 3313 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 639 NumberOfCodeBlocks, 639 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 589 ConstructedInterpolants, 95 QuantifiedInterpolants, 61429 SizeOfPredicates, 175 NumberOfNonLiveVariables, 2106 ConjunctsInSsa, 399 ConjunctsInUnsatCore, 50 InterpolantComputations, 4 PerfectInterpolantSequences, 29/369 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...