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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:13:24,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:13:24,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:13:24,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:13:24,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:13:24,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:13:24,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:13:24,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:13:25,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:13:25,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:13:25,005 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:13:25,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:13:25,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:13:25,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:13:25,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:13:25,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:13:25,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:13:25,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:13:25,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:13:25,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:13:25,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:13:25,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:13:25,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:13:25,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:13:25,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:13:25,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:13:25,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:13:25,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:13:25,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:13:25,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:13:25,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:13:25,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:13:25,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:13:25,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:13:25,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:13:25,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:13:25,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:13:25,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:13:25,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:13:25,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:13:25,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:13:25,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:13:25,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:13:25,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:13:25,119 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:13:25,120 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:13:25,120 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2019-08-05 10:13:25,121 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2019-08-05 10:13:25,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:13:25,164 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:13:25,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:25,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:13:25,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:13:25,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,195 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:13:25,196 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:13:25,196 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:13:25,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:25,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:13:25,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:13:25,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:13:25,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... [2019-08-05 10:13:25,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:13:25,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:13:25,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:13:25,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:13:25,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:13:25,288 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-05 10:13:25,289 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-05 10:13:25,289 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-05 10:13:25,687 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-05 10:13:25,689 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:13:25,690 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:13:25,691 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:25 BoogieIcfgContainer [2019-08-05 10:13:25,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:13:25,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:13:25,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:13:25,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:13:25,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:25" (1/2) ... [2019-08-05 10:13:25,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45601c88 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:13:25, skipping insertion in model container [2019-08-05 10:13:25,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:25" (2/2) ... [2019-08-05 10:13:25,699 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2019-08-05 10:13:25,708 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:13:25,716 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 10:13:25,736 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 10:13:25,761 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:13:25,762 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:13:25,762 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:13:25,762 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:13:25,763 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:13:25,763 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:13:25,763 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:13:25,763 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:13:25,763 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:13:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-08-05 10:13:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:13:25,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:13:25,791 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2019-08-05 10:13:25,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:26,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:26,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:26,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:26,039 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-08-05 10:13:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:26,661 INFO L93 Difference]: Finished difference Result 47 states and 83 transitions. [2019-08-05 10:13:26,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:26,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:13:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:26,687 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:13:26,688 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:13:26,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-05 10:13:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:13:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2019-08-05 10:13:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:13:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-08-05 10:13:26,724 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2019-08-05 10:13:26,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:26,724 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-08-05 10:13:26,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-08-05 10:13:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:13:26,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:26,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:13:26,726 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2019-08-05 10:13:26,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:26,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:13:26,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:26,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:26,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:26,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:26,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:26,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:26,827 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2019-08-05 10:13:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,159 INFO L93 Difference]: Finished difference Result 55 states and 97 transitions. [2019-08-05 10:13:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:27,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:13:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,161 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:13:27,161 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:13:27,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-05 10:13:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:13:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-08-05 10:13:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:13:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2019-08-05 10:13:27,169 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2019-08-05 10:13:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,169 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2019-08-05 10:13:27,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2019-08-05 10:13:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:13:27,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:27,172 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2019-08-05 10:13:27,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:27,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:27,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:27,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:27,454 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 6 states. [2019-08-05 10:13:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,925 INFO L93 Difference]: Finished difference Result 65 states and 115 transitions. [2019-08-05 10:13:27,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:27,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:13:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,929 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:13:27,930 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:13:27,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:13:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2019-08-05 10:13:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:13:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2019-08-05 10:13:27,937 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 7 [2019-08-05 10:13:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,938 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2019-08-05 10:13:27,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2019-08-05 10:13:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:13:27,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,939 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:13:27,939 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2019-08-05 10:13:27,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:28,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:28,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:28,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:28,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:28,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:28,005 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand 4 states. [2019-08-05 10:13:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,077 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2019-08-05 10:13:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:28,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:13:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,081 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:13:28,081 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:13:28,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:13:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:13:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:13:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2019-08-05 10:13:28,087 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 7 [2019-08-05 10:13:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,088 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2019-08-05 10:13:28,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2019-08-05 10:13:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:13:28,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:28,090 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2072633864, now seen corresponding path program 1 times [2019-08-05 10:13:28,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:28,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:13:28,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:28,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:28,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:28,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:28,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:28,173 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 4 states. [2019-08-05 10:13:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,247 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-08-05 10:13:28,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:28,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:13:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,250 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:13:28,250 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:13:28,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:13:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:13:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:13:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2019-08-05 10:13:28,258 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 7 [2019-08-05 10:13:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,258 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2019-08-05 10:13:28,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2019-08-05 10:13:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:13:28,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:28,260 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2071833542, now seen corresponding path program 1 times [2019-08-05 10:13:28,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:28,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:28,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:28,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:28,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:28,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:28,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:28,371 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand 6 states. [2019-08-05 10:13:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,980 INFO L93 Difference]: Finished difference Result 69 states and 102 transitions. [2019-08-05 10:13:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:28,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:13:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,982 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:13:28,982 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:13:28,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-05 10:13:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:13:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2019-08-05 10:13:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:13:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2019-08-05 10:13:28,989 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 7 [2019-08-05 10:13:28,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,989 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2019-08-05 10:13:28,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2019-08-05 10:13:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:13:28,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:28,991 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2019-08-05 10:13:28,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:29,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:29,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:29,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:29,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:29,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:29,100 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand 7 states. [2019-08-05 10:13:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:29,521 INFO L93 Difference]: Finished difference Result 128 states and 191 transitions. [2019-08-05 10:13:29,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:13:29,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:13:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:29,523 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:13:29,523 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:13:29,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-05 10:13:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:13:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 91. [2019-08-05 10:13:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:13:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 144 transitions. [2019-08-05 10:13:29,543 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 144 transitions. Word has length 10 [2019-08-05 10:13:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:29,543 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 144 transitions. [2019-08-05 10:13:29,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 144 transitions. [2019-08-05 10:13:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:13:29,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:29,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:29,545 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2019-08-05 10:13:29,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:29,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:29,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:29,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:29,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:29,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:29,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:29,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:29,648 INFO L87 Difference]: Start difference. First operand 91 states and 144 transitions. Second operand 7 states. [2019-08-05 10:13:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:30,043 INFO L93 Difference]: Finished difference Result 214 states and 347 transitions. [2019-08-05 10:13:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:30,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:13:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:30,046 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:13:30,046 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 10:13:30,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-05 10:13:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 10:13:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 160. [2019-08-05 10:13:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:13:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 265 transitions. [2019-08-05 10:13:30,059 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 265 transitions. Word has length 10 [2019-08-05 10:13:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:30,060 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 265 transitions. [2019-08-05 10:13:30,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 265 transitions. [2019-08-05 10:13:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:13:30,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:30,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:30,062 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2019-08-05 10:13:30,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:30,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:30,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:30,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:30,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:30,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:30,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:30,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:30,170 INFO L87 Difference]: Start difference. First operand 160 states and 265 transitions. Second operand 7 states. [2019-08-05 10:13:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:30,671 INFO L93 Difference]: Finished difference Result 196 states and 313 transitions. [2019-08-05 10:13:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:30,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:13:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:30,674 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:13:30,674 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:13:30,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:13:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2019-08-05 10:13:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:13:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 259 transitions. [2019-08-05 10:13:30,685 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 259 transitions. Word has length 10 [2019-08-05 10:13:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:30,685 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 259 transitions. [2019-08-05 10:13:30,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 259 transitions. [2019-08-05 10:13:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:13:30,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:30,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:30,688 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2019-08-05 10:13:30,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:30,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:30,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:30,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:30,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:30,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:30,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:30,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:30,760 INFO L87 Difference]: Start difference. First operand 157 states and 259 transitions. Second operand 7 states. [2019-08-05 10:13:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:31,329 INFO L93 Difference]: Finished difference Result 285 states and 468 transitions. [2019-08-05 10:13:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:31,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:13:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:31,332 INFO L225 Difference]: With dead ends: 285 [2019-08-05 10:13:31,332 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 10:13:31,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 10:13:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 223. [2019-08-05 10:13:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 10:13:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 375 transitions. [2019-08-05 10:13:31,344 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 375 transitions. Word has length 10 [2019-08-05 10:13:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:31,344 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 375 transitions. [2019-08-05 10:13:31,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 375 transitions. [2019-08-05 10:13:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:13:31,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:31,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:31,346 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:31,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:31,346 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2019-08-05 10:13:31,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:31,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:13:31,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:31,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:31,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:31,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:31,742 INFO L87 Difference]: Start difference. First operand 223 states and 375 transitions. Second operand 8 states. [2019-08-05 10:13:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,460 INFO L93 Difference]: Finished difference Result 314 states and 518 transitions. [2019-08-05 10:13:32,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:13:32,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:13:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:32,464 INFO L225 Difference]: With dead ends: 314 [2019-08-05 10:13:32,464 INFO L226 Difference]: Without dead ends: 314 [2019-08-05 10:13:32,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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-05 10:13:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-05 10:13:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 256. [2019-08-05 10:13:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 10:13:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 433 transitions. [2019-08-05 10:13:32,476 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 433 transitions. Word has length 10 [2019-08-05 10:13:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:32,476 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 433 transitions. [2019-08-05 10:13:32,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 433 transitions. [2019-08-05 10:13:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:13:32,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:32,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:32,478 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:32,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash -981869319, now seen corresponding path program 1 times [2019-08-05 10:13:32,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:32,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:32,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:32,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:32,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:32,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:32,640 INFO L87 Difference]: Start difference. First operand 256 states and 433 transitions. Second operand 7 states. [2019-08-05 10:13:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,947 INFO L93 Difference]: Finished difference Result 316 states and 518 transitions. [2019-08-05 10:13:32,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:13:32,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:13:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:32,950 INFO L225 Difference]: With dead ends: 316 [2019-08-05 10:13:32,951 INFO L226 Difference]: Without dead ends: 316 [2019-08-05 10:13:32,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-05 10:13:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-08-05 10:13:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-08-05 10:13:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-05 10:13:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 433 transitions. [2019-08-05 10:13:32,960 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 433 transitions. Word has length 10 [2019-08-05 10:13:32,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:32,960 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 433 transitions. [2019-08-05 10:13:32,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 433 transitions. [2019-08-05 10:13:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:13:32,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:32,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:32,962 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:32,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2019-08-05 10:13:32,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:32,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:32,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:33,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:33,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:33,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:33,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:33,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:33,071 INFO L87 Difference]: Start difference. First operand 259 states and 433 transitions. Second operand 7 states. [2019-08-05 10:13:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:33,799 INFO L93 Difference]: Finished difference Result 436 states and 717 transitions. [2019-08-05 10:13:33,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:13:33,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:13:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:33,812 INFO L225 Difference]: With dead ends: 436 [2019-08-05 10:13:33,812 INFO L226 Difference]: Without dead ends: 436 [2019-08-05 10:13:33,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-08-05 10:13:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 314. [2019-08-05 10:13:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-08-05 10:13:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 529 transitions. [2019-08-05 10:13:33,823 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 529 transitions. Word has length 10 [2019-08-05 10:13:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:33,823 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 529 transitions. [2019-08-05 10:13:33,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 529 transitions. [2019-08-05 10:13:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:33,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:33,824 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:33,825 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1417035270, now seen corresponding path program 2 times [2019-08-05 10:13:33,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:33,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:33,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:34,053 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-05 10:13:34,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:34,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:34,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:34,055 INFO L87 Difference]: Start difference. First operand 314 states and 529 transitions. Second operand 7 states. [2019-08-05 10:13:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:34,431 INFO L93 Difference]: Finished difference Result 409 states and 671 transitions. [2019-08-05 10:13:34,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:34,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:34,435 INFO L225 Difference]: With dead ends: 409 [2019-08-05 10:13:34,435 INFO L226 Difference]: Without dead ends: 409 [2019-08-05 10:13:34,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-08-05 10:13:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 343. [2019-08-05 10:13:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-08-05 10:13:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 575 transitions. [2019-08-05 10:13:34,445 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 575 transitions. Word has length 13 [2019-08-05 10:13:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:34,445 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 575 transitions. [2019-08-05 10:13:34,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 575 transitions. [2019-08-05 10:13:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:34,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:34,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:34,447 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1130446276, now seen corresponding path program 1 times [2019-08-05 10:13:34,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:34,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:34,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:34,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:34,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:34,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:34,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:34,513 INFO L87 Difference]: Start difference. First operand 343 states and 575 transitions. Second operand 7 states. [2019-08-05 10:13:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:34,971 INFO L93 Difference]: Finished difference Result 500 states and 828 transitions. [2019-08-05 10:13:34,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:34,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:34,975 INFO L225 Difference]: With dead ends: 500 [2019-08-05 10:13:34,975 INFO L226 Difference]: Without dead ends: 500 [2019-08-05 10:13:34,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-08-05 10:13:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 357. [2019-08-05 10:13:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-08-05 10:13:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 600 transitions. [2019-08-05 10:13:34,986 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 600 transitions. Word has length 13 [2019-08-05 10:13:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:34,987 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 600 transitions. [2019-08-05 10:13:34,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 600 transitions. [2019-08-05 10:13:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:34,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:34,988 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:34,989 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:34,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash -86605091, now seen corresponding path program 1 times [2019-08-05 10:13:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:35,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:35,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:35,065 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-05 10:13:35,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:35,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:35,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:35,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:35,067 INFO L87 Difference]: Start difference. First operand 357 states and 600 transitions. Second operand 7 states. [2019-08-05 10:13:36,042 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:36,577 INFO L93 Difference]: Finished difference Result 509 states and 848 transitions. [2019-08-05 10:13:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:36,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:36,581 INFO L225 Difference]: With dead ends: 509 [2019-08-05 10:13:36,582 INFO L226 Difference]: Without dead ends: 509 [2019-08-05 10:13:36,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:13:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-08-05 10:13:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 413. [2019-08-05 10:13:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-08-05 10:13:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 704 transitions. [2019-08-05 10:13:36,594 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 704 transitions. Word has length 13 [2019-08-05 10:13:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:36,594 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 704 transitions. [2019-08-05 10:13:36,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 704 transitions. [2019-08-05 10:13:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:36,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:36,595 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:36,596 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:36,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 2 times [2019-08-05 10:13:36,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:36,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:36,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:36,681 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-05 10:13:36,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:36,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:36,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:36,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:36,683 INFO L87 Difference]: Start difference. First operand 413 states and 704 transitions. Second operand 7 states. [2019-08-05 10:13:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:37,459 INFO L93 Difference]: Finished difference Result 490 states and 816 transitions. [2019-08-05 10:13:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:37,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:37,463 INFO L225 Difference]: With dead ends: 490 [2019-08-05 10:13:37,463 INFO L226 Difference]: Without dead ends: 490 [2019-08-05 10:13:37,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-08-05 10:13:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 389. [2019-08-05 10:13:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-08-05 10:13:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 660 transitions. [2019-08-05 10:13:37,474 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 660 transitions. Word has length 13 [2019-08-05 10:13:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:37,474 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 660 transitions. [2019-08-05 10:13:37,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 660 transitions. [2019-08-05 10:13:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:37,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:37,476 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:37,476 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1752710470, now seen corresponding path program 2 times [2019-08-05 10:13:37,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:37,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:37,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:37,573 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-05 10:13:37,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:37,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:37,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:37,577 INFO L87 Difference]: Start difference. First operand 389 states and 660 transitions. Second operand 7 states. [2019-08-05 10:13:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:38,071 INFO L93 Difference]: Finished difference Result 480 states and 798 transitions. [2019-08-05 10:13:38,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:38,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:38,075 INFO L225 Difference]: With dead ends: 480 [2019-08-05 10:13:38,075 INFO L226 Difference]: Without dead ends: 480 [2019-08-05 10:13:38,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 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-05 10:13:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-08-05 10:13:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 357. [2019-08-05 10:13:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-08-05 10:13:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 603 transitions. [2019-08-05 10:13:38,084 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 603 transitions. Word has length 13 [2019-08-05 10:13:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:38,084 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 603 transitions. [2019-08-05 10:13:38,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 603 transitions. [2019-08-05 10:13:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:38,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:38,085 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:38,086 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:38,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:38,086 INFO L82 PathProgramCache]: Analyzing trace with hash 275962246, now seen corresponding path program 2 times [2019-08-05 10:13:38,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:38,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:38,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:38,218 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-05 10:13:38,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:38,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:38,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:38,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:38,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:38,219 INFO L87 Difference]: Start difference. First operand 357 states and 603 transitions. Second operand 7 states. [2019-08-05 10:13:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:38,719 INFO L93 Difference]: Finished difference Result 538 states and 902 transitions. [2019-08-05 10:13:38,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:38,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:38,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:38,723 INFO L225 Difference]: With dead ends: 538 [2019-08-05 10:13:38,724 INFO L226 Difference]: Without dead ends: 538 [2019-08-05 10:13:38,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 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-05 10:13:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-08-05 10:13:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 437. [2019-08-05 10:13:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-08-05 10:13:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 744 transitions. [2019-08-05 10:13:38,734 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 744 transitions. Word has length 13 [2019-08-05 10:13:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:38,734 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 744 transitions. [2019-08-05 10:13:38,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 744 transitions. [2019-08-05 10:13:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:38,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:38,736 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:38,736 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:38,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2019-08-05 10:13:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:38,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:38,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:38,856 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-05 10:13:38,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:38,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:38,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:38,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:38,857 INFO L87 Difference]: Start difference. First operand 437 states and 744 transitions. Second operand 7 states. [2019-08-05 10:13:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:39,223 INFO L93 Difference]: Finished difference Result 556 states and 930 transitions. [2019-08-05 10:13:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:39,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:39,227 INFO L225 Difference]: With dead ends: 556 [2019-08-05 10:13:39,227 INFO L226 Difference]: Without dead ends: 556 [2019-08-05 10:13:39,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-08-05 10:13:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 450. [2019-08-05 10:13:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-08-05 10:13:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 763 transitions. [2019-08-05 10:13:39,238 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 763 transitions. Word has length 13 [2019-08-05 10:13:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:39,240 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 763 transitions. [2019-08-05 10:13:39,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 763 transitions. [2019-08-05 10:13:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:39,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:39,242 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:39,243 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277807, now seen corresponding path program 2 times [2019-08-05 10:13:39,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:39,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:39,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:39,662 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-05 10:13:39,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:39,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:39,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:39,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:39,663 INFO L87 Difference]: Start difference. First operand 450 states and 763 transitions. Second operand 7 states. [2019-08-05 10:13:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:40,035 INFO L93 Difference]: Finished difference Result 588 states and 975 transitions. [2019-08-05 10:13:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:40,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:40,039 INFO L225 Difference]: With dead ends: 588 [2019-08-05 10:13:40,040 INFO L226 Difference]: Without dead ends: 588 [2019-08-05 10:13:40,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:13:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-08-05 10:13:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 482. [2019-08-05 10:13:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-08-05 10:13:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 815 transitions. [2019-08-05 10:13:40,049 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 815 transitions. Word has length 13 [2019-08-05 10:13:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:40,050 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 815 transitions. [2019-08-05 10:13:40,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 815 transitions. [2019-08-05 10:13:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:40,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:40,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:40,051 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash -229856780, now seen corresponding path program 1 times [2019-08-05 10:13:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:40,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:40,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:40,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:40,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:40,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:40,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:40,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:40,131 INFO L87 Difference]: Start difference. First operand 482 states and 815 transitions. Second operand 7 states. [2019-08-05 10:13:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:40,764 INFO L93 Difference]: Finished difference Result 611 states and 1013 transitions. [2019-08-05 10:13:40,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:40,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:40,771 INFO L225 Difference]: With dead ends: 611 [2019-08-05 10:13:40,771 INFO L226 Difference]: Without dead ends: 611 [2019-08-05 10:13:40,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-08-05 10:13:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 465. [2019-08-05 10:13:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-08-05 10:13:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 783 transitions. [2019-08-05 10:13:40,780 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 783 transitions. Word has length 13 [2019-08-05 10:13:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:40,780 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 783 transitions. [2019-08-05 10:13:40,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 783 transitions. [2019-08-05 10:13:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:40,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:40,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:40,782 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash -238444949, now seen corresponding path program 1 times [2019-08-05 10:13:40,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:40,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:40,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:40,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:40,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:40,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:40,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:40,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:40,865 INFO L87 Difference]: Start difference. First operand 465 states and 783 transitions. Second operand 7 states. [2019-08-05 10:13:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:41,157 INFO L93 Difference]: Finished difference Result 546 states and 901 transitions. [2019-08-05 10:13:41,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:41,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:41,160 INFO L225 Difference]: With dead ends: 546 [2019-08-05 10:13:41,161 INFO L226 Difference]: Without dead ends: 546 [2019-08-05 10:13:41,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 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-05 10:13:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-08-05 10:13:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 438. [2019-08-05 10:13:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-08-05 10:13:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 735 transitions. [2019-08-05 10:13:41,168 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 735 transitions. Word has length 13 [2019-08-05 10:13:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:41,169 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 735 transitions. [2019-08-05 10:13:41,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 735 transitions. [2019-08-05 10:13:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:13:41,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:41,170 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:41,170 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1844731974, now seen corresponding path program 2 times [2019-08-05 10:13:41,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:41,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:41,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:41,281 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-05 10:13:41,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:41,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:41,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:41,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:41,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:41,282 INFO L87 Difference]: Start difference. First operand 438 states and 735 transitions. Second operand 7 states. [2019-08-05 10:13:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:41,704 INFO L93 Difference]: Finished difference Result 547 states and 899 transitions. [2019-08-05 10:13:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:41,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:13:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:41,707 INFO L225 Difference]: With dead ends: 547 [2019-08-05 10:13:41,707 INFO L226 Difference]: Without dead ends: 547 [2019-08-05 10:13:41,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-08-05 10:13:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 432. [2019-08-05 10:13:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-08-05 10:13:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 721 transitions. [2019-08-05 10:13:41,715 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 721 transitions. Word has length 13 [2019-08-05 10:13:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:41,716 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 721 transitions. [2019-08-05 10:13:41,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 721 transitions. [2019-08-05 10:13:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:13:41,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:41,717 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:41,717 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1301349131, now seen corresponding path program 1 times [2019-08-05 10:13:41,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:41,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:41,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:41,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:41,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:41,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:41,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:41,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:41,933 INFO L87 Difference]: Start difference. First operand 432 states and 721 transitions. Second operand 9 states. [2019-08-05 10:13:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:42,383 INFO L93 Difference]: Finished difference Result 655 states and 1088 transitions. [2019-08-05 10:13:42,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:42,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:13:42,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:42,387 INFO L225 Difference]: With dead ends: 655 [2019-08-05 10:13:42,387 INFO L226 Difference]: Without dead ends: 655 [2019-08-05 10:13:42,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-08-05 10:13:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 314. [2019-08-05 10:13:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-08-05 10:13:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 530 transitions. [2019-08-05 10:13:42,393 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 530 transitions. Word has length 15 [2019-08-05 10:13:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:42,393 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 530 transitions. [2019-08-05 10:13:42,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 530 transitions. [2019-08-05 10:13:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:13:42,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:42,395 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:42,395 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577919, now seen corresponding path program 1 times [2019-08-05 10:13:42,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:42,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:13:42,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:42,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:42,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:13:42,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:13:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:13:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:42,558 INFO L87 Difference]: Start difference. First operand 314 states and 530 transitions. Second operand 12 states. [2019-08-05 10:13:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:45,466 INFO L93 Difference]: Finished difference Result 587 states and 969 transitions. [2019-08-05 10:13:45,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:13:45,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-05 10:13:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:45,471 INFO L225 Difference]: With dead ends: 587 [2019-08-05 10:13:45,471 INFO L226 Difference]: Without dead ends: 587 [2019-08-05 10:13:45,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-08-05 10:13:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 421. [2019-08-05 10:13:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-08-05 10:13:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 720 transitions. [2019-08-05 10:13:45,479 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 720 transitions. Word has length 15 [2019-08-05 10:13:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:45,480 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 720 transitions. [2019-08-05 10:13:45,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:13:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 720 transitions. [2019-08-05 10:13:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:13:45,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:45,481 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:13:45,481 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:45,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577149, now seen corresponding path program 1 times [2019-08-05 10:13:45,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:45,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:45,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:45,638 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-05 10:13:45,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:45,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:45,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:45,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:45,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:45,639 INFO L87 Difference]: Start difference. First operand 421 states and 720 transitions. Second operand 8 states. [2019-08-05 10:13:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:46,058 INFO L93 Difference]: Finished difference Result 466 states and 779 transitions. [2019-08-05 10:13:46,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:13:46,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 10:13:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:46,061 INFO L225 Difference]: With dead ends: 466 [2019-08-05 10:13:46,061 INFO L226 Difference]: Without dead ends: 466 [2019-08-05 10:13:46,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:13:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-08-05 10:13:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 421. [2019-08-05 10:13:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-08-05 10:13:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 716 transitions. [2019-08-05 10:13:46,069 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 716 transitions. Word has length 15 [2019-08-05 10:13:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:46,069 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 716 transitions. [2019-08-05 10:13:46,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 716 transitions. [2019-08-05 10:13:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:13:46,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:46,070 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:46,071 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -57530837, now seen corresponding path program 1 times [2019-08-05 10:13:46,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:46,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:46,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:46,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:46,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:46,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:46,160 INFO L87 Difference]: Start difference. First operand 421 states and 716 transitions. Second operand 9 states. [2019-08-05 10:13:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:46,784 INFO L93 Difference]: Finished difference Result 546 states and 922 transitions. [2019-08-05 10:13:46,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:46,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:13:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:46,787 INFO L225 Difference]: With dead ends: 546 [2019-08-05 10:13:46,787 INFO L226 Difference]: Without dead ends: 546 [2019-08-05 10:13:46,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-08-05 10:13:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 270. [2019-08-05 10:13:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-08-05 10:13:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 459 transitions. [2019-08-05 10:13:46,793 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 459 transitions. Word has length 15 [2019-08-05 10:13:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:46,793 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 459 transitions. [2019-08-05 10:13:46,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 459 transitions. [2019-08-05 10:13:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:46,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:46,794 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:46,795 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash -992157619, now seen corresponding path program 1 times [2019-08-05 10:13:46,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:46,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:46,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:46,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:46,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:46,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:46,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:46,937 INFO L87 Difference]: Start difference. First operand 270 states and 459 transitions. Second operand 9 states. [2019-08-05 10:13:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:47,565 INFO L93 Difference]: Finished difference Result 409 states and 684 transitions. [2019-08-05 10:13:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:47,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:47,568 INFO L225 Difference]: With dead ends: 409 [2019-08-05 10:13:47,569 INFO L226 Difference]: Without dead ends: 409 [2019-08-05 10:13:47,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-08-05 10:13:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 291. [2019-08-05 10:13:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-05 10:13:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 497 transitions. [2019-08-05 10:13:47,574 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 497 transitions. Word has length 18 [2019-08-05 10:13:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:47,574 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 497 transitions. [2019-08-05 10:13:47,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 497 transitions. [2019-08-05 10:13:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:47,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:47,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:47,575 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:47,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1270158444, now seen corresponding path program 1 times [2019-08-05 10:13:47,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:47,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:47,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:47,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:47,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:47,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:47,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:47,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:47,691 INFO L87 Difference]: Start difference. First operand 291 states and 497 transitions. Second operand 9 states. [2019-08-05 10:13:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:48,122 INFO L93 Difference]: Finished difference Result 379 states and 635 transitions. [2019-08-05 10:13:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:13:48,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:48,126 INFO L225 Difference]: With dead ends: 379 [2019-08-05 10:13:48,126 INFO L226 Difference]: Without dead ends: 379 [2019-08-05 10:13:48,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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-05 10:13:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-08-05 10:13:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 308. [2019-08-05 10:13:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 10:13:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 522 transitions. [2019-08-05 10:13:48,133 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 522 transitions. Word has length 18 [2019-08-05 10:13:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:48,133 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 522 transitions. [2019-08-05 10:13:48,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 522 transitions. [2019-08-05 10:13:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:48,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:48,134 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:48,135 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:48,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:48,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1278746613, now seen corresponding path program 1 times [2019-08-05 10:13:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:48,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:48,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:48,231 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-05 10:13:48,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:48,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:48,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:48,232 INFO L87 Difference]: Start difference. First operand 308 states and 522 transitions. Second operand 9 states. [2019-08-05 10:13:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:48,716 INFO L93 Difference]: Finished difference Result 412 states and 690 transitions. [2019-08-05 10:13:48,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:48,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:48,727 INFO L225 Difference]: With dead ends: 412 [2019-08-05 10:13:48,727 INFO L226 Difference]: Without dead ends: 412 [2019-08-05 10:13:48,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 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-05 10:13:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-08-05 10:13:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 306. [2019-08-05 10:13:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-08-05 10:13:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 520 transitions. [2019-08-05 10:13:48,731 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 520 transitions. Word has length 18 [2019-08-05 10:13:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:48,731 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 520 transitions. [2019-08-05 10:13:48,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 520 transitions. [2019-08-05 10:13:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:48,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:48,732 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:48,733 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:48,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1502173349, now seen corresponding path program 2 times [2019-08-05 10:13:48,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:48,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:48,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:49,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:49,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:49,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:49,162 INFO L87 Difference]: Start difference. First operand 306 states and 520 transitions. Second operand 9 states. [2019-08-05 10:13:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:49,792 INFO L93 Difference]: Finished difference Result 453 states and 750 transitions. [2019-08-05 10:13:49,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:13:49,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:49,795 INFO L225 Difference]: With dead ends: 453 [2019-08-05 10:13:49,795 INFO L226 Difference]: Without dead ends: 453 [2019-08-05 10:13:49,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-08-05 10:13:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 261. [2019-08-05 10:13:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-08-05 10:13:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 439 transitions. [2019-08-05 10:13:49,801 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 439 transitions. Word has length 18 [2019-08-05 10:13:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:49,801 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 439 transitions. [2019-08-05 10:13:49,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 439 transitions. [2019-08-05 10:13:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:49,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:49,802 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:49,802 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172524, now seen corresponding path program 2 times [2019-08-05 10:13:49,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:49,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:13:49,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:49,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:49,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:13:49,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:49,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:49,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:49,897 INFO L87 Difference]: Start difference. First operand 261 states and 439 transitions. Second operand 9 states. [2019-08-05 10:13:50,510 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:13:51,341 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:13:51,705 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:13:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:51,836 INFO L93 Difference]: Finished difference Result 334 states and 543 transitions. [2019-08-05 10:13:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:13:51,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:51,839 INFO L225 Difference]: With dead ends: 334 [2019-08-05 10:13:51,839 INFO L226 Difference]: Without dead ends: 334 [2019-08-05 10:13:51,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-08-05 10:13:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 253. [2019-08-05 10:13:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 10:13:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 423 transitions. [2019-08-05 10:13:51,844 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 423 transitions. Word has length 18 [2019-08-05 10:13:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:51,844 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 423 transitions. [2019-08-05 10:13:51,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 423 transitions. [2019-08-05 10:13:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:51,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:51,845 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:51,845 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1215584355, now seen corresponding path program 2 times [2019-08-05 10:13:51,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:51,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:51,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:51,904 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-05 10:13:51,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:51,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:51,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:51,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:51,905 INFO L87 Difference]: Start difference. First operand 253 states and 423 transitions. Second operand 9 states. [2019-08-05 10:13:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:52,459 INFO L93 Difference]: Finished difference Result 372 states and 609 transitions. [2019-08-05 10:13:52,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:13:52,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:52,461 INFO L225 Difference]: With dead ends: 372 [2019-08-05 10:13:52,462 INFO L226 Difference]: Without dead ends: 372 [2019-08-05 10:13:52,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-08-05 10:13:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 234. [2019-08-05 10:13:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-08-05 10:13:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 390 transitions. [2019-08-05 10:13:52,467 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 390 transitions. Word has length 18 [2019-08-05 10:13:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:52,467 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 390 transitions. [2019-08-05 10:13:52,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 390 transitions. [2019-08-05 10:13:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:52,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:52,468 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:52,468 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:52,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1467012, now seen corresponding path program 1 times [2019-08-05 10:13:52,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:52,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:13:52,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:52,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:52,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:13:52,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:52,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:52,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:52,541 INFO L87 Difference]: Start difference. First operand 234 states and 390 transitions. Second operand 9 states. [2019-08-05 10:13:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:53,129 INFO L93 Difference]: Finished difference Result 352 states and 576 transitions. [2019-08-05 10:13:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:13:53,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:53,132 INFO L225 Difference]: With dead ends: 352 [2019-08-05 10:13:53,132 INFO L226 Difference]: Without dead ends: 352 [2019-08-05 10:13:53,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-08-05 10:13:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 219. [2019-08-05 10:13:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-08-05 10:13:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 365 transitions. [2019-08-05 10:13:53,136 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 365 transitions. Word has length 18 [2019-08-05 10:13:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:53,136 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 365 transitions. [2019-08-05 10:13:53,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 365 transitions. [2019-08-05 10:13:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:53,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:53,137 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:53,137 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:53,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1846436718, now seen corresponding path program 2 times [2019-08-05 10:13:53,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:53,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:13:53,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:53,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:53,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:13:53,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:53,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:53,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:53,181 INFO L87 Difference]: Start difference. First operand 219 states and 365 transitions. Second operand 9 states. [2019-08-05 10:13:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:53,816 INFO L93 Difference]: Finished difference Result 284 states and 461 transitions. [2019-08-05 10:13:53,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:13:53,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:53,818 INFO L225 Difference]: With dead ends: 284 [2019-08-05 10:13:53,818 INFO L226 Difference]: Without dead ends: 284 [2019-08-05 10:13:53,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-08-05 10:13:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 135. [2019-08-05 10:13:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:13:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 219 transitions. [2019-08-05 10:13:53,821 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 219 transitions. Word has length 18 [2019-08-05 10:13:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:53,821 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 219 transitions. [2019-08-05 10:13:53,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 219 transitions. [2019-08-05 10:13:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:53,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:53,822 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:53,822 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:53,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1837848549, now seen corresponding path program 1 times [2019-08-05 10:13:53,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:53,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:53,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:53,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:53,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:53,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:53,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:53,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:53,924 INFO L87 Difference]: Start difference. First operand 135 states and 219 transitions. Second operand 9 states. [2019-08-05 10:13:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:54,503 INFO L93 Difference]: Finished difference Result 176 states and 282 transitions. [2019-08-05 10:13:54,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:54,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:54,505 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:13:54,505 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:13:54,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:13:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 98. [2019-08-05 10:13:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:13:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2019-08-05 10:13:54,509 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 18 [2019-08-05 10:13:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:54,509 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2019-08-05 10:13:54,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2019-08-05 10:13:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:54,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:54,510 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:54,511 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:54,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:54,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1672170852, now seen corresponding path program 1 times [2019-08-05 10:13:54,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:54,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:54,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:54,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:54,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:54,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:54,598 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand 9 states. [2019-08-05 10:13:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:55,123 INFO L93 Difference]: Finished difference Result 208 states and 326 transitions. [2019-08-05 10:13:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:13:55,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:55,125 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:13:55,125 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 10:13:55,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 10:13:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 114. [2019-08-05 10:13:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:13:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 182 transitions. [2019-08-05 10:13:55,129 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 182 transitions. Word has length 18 [2019-08-05 10:13:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:55,129 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 182 transitions. [2019-08-05 10:13:55,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 182 transitions. [2019-08-05 10:13:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:55,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:55,129 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:55,130 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash 589747428, now seen corresponding path program 2 times [2019-08-05 10:13:55,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:55,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:55,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:55,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:55,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:55,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:55,221 INFO L87 Difference]: Start difference. First operand 114 states and 182 transitions. Second operand 9 states. [2019-08-05 10:13:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:55,814 INFO L93 Difference]: Finished difference Result 177 states and 278 transitions. [2019-08-05 10:13:55,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:13:55,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:55,816 INFO L225 Difference]: With dead ends: 177 [2019-08-05 10:13:55,816 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 10:13:55,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 10:13:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-08-05 10:13:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:13:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 199 transitions. [2019-08-05 10:13:55,819 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 199 transitions. Word has length 18 [2019-08-05 10:13:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:55,820 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 199 transitions. [2019-08-05 10:13:55,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 199 transitions. [2019-08-05 10:13:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:55,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:55,820 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:55,821 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:55,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash 581159259, now seen corresponding path program 1 times [2019-08-05 10:13:55,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:55,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:55,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:56,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:56,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:56,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:56,187 INFO L87 Difference]: Start difference. First operand 123 states and 199 transitions. Second operand 9 states. [2019-08-05 10:13:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:56,762 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2019-08-05 10:13:56,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:56,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:56,764 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:13:56,764 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:13:56,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:13:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:13:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 116. [2019-08-05 10:13:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:13:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 188 transitions. [2019-08-05 10:13:56,767 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 188 transitions. Word has length 18 [2019-08-05 10:13:56,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:56,768 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 188 transitions. [2019-08-05 10:13:56,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 188 transitions. [2019-08-05 10:13:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:56,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:56,768 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:56,768 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:56,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:56,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1655319964, now seen corresponding path program 3 times [2019-08-05 10:13:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:56,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:56,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:56,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:56,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:56,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:56,903 INFO L87 Difference]: Start difference. First operand 116 states and 188 transitions. Second operand 9 states. [2019-08-05 10:13:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:57,533 INFO L93 Difference]: Finished difference Result 163 states and 258 transitions. [2019-08-05 10:13:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:57,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:57,534 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:13:57,534 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:13:57,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:13:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 108. [2019-08-05 10:13:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:13:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 173 transitions. [2019-08-05 10:13:57,537 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 173 transitions. Word has length 18 [2019-08-05 10:13:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:57,537 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 173 transitions. [2019-08-05 10:13:57,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 173 transitions. [2019-08-05 10:13:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:57,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:57,538 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:57,538 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1646731795, now seen corresponding path program 2 times [2019-08-05 10:13:57,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:57,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:57,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:57,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:57,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:57,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:57,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:57,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:57,652 INFO L87 Difference]: Start difference. First operand 108 states and 173 transitions. Second operand 9 states. [2019-08-05 10:13:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:58,252 INFO L93 Difference]: Finished difference Result 155 states and 243 transitions. [2019-08-05 10:13:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:13:58,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:58,254 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:13:58,254 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:13:58,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:13:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 107. [2019-08-05 10:13:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:13:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 171 transitions. [2019-08-05 10:13:58,257 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 171 transitions. Word has length 18 [2019-08-05 10:13:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:58,257 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 171 transitions. [2019-08-05 10:13:58,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 171 transitions. [2019-08-05 10:13:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:58,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:58,258 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:58,258 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash -800331771, now seen corresponding path program 3 times [2019-08-05 10:13:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:58,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:58,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:58,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:58,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:58,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:58,343 INFO L87 Difference]: Start difference. First operand 107 states and 171 transitions. Second operand 9 states. [2019-08-05 10:13:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:58,789 INFO L93 Difference]: Finished difference Result 142 states and 225 transitions. [2019-08-05 10:13:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:58,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:58,790 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:13:58,790 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:13:58,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 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-05 10:13:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:13:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 79. [2019-08-05 10:13:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:13:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2019-08-05 10:13:58,793 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 18 [2019-08-05 10:13:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:58,794 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2019-08-05 10:13:58,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2019-08-05 10:13:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:58,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:58,794 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:58,794 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1512966418, now seen corresponding path program 1 times [2019-08-05 10:13:58,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:58,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:58,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:58,920 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-05 10:13:58,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:58,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:58,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:58,921 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand 9 states. [2019-08-05 10:13:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:59,326 INFO L93 Difference]: Finished difference Result 136 states and 213 transitions. [2019-08-05 10:13:59,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:59,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:59,333 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:13:59,333 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:13:59,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 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-05 10:13:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:13:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 59. [2019-08-05 10:13:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:13:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2019-08-05 10:13:59,334 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 18 [2019-08-05 10:13:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:59,335 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2019-08-05 10:13:59,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2019-08-05 10:13:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:59,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:59,335 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:59,335 INFO L418 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash 748951862, now seen corresponding path program 2 times [2019-08-05 10:13:59,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:59,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:59,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:59,512 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-05 10:13:59,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:59,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:59,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:59,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:59,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:59,513 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand 9 states. [2019-08-05 10:13:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:59,971 INFO L93 Difference]: Finished difference Result 125 states and 198 transitions. [2019-08-05 10:13:59,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:59,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:13:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:59,973 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:13:59,973 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:13:59,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 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-05 10:13:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:13:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 45. [2019-08-05 10:13:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:13:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2019-08-05 10:13:59,975 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 18 [2019-08-05 10:13:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:59,975 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2019-08-05 10:13:59,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2019-08-05 10:13:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:13:59,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:59,976 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:59,976 INFO L418 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash 740363693, now seen corresponding path program 1 times [2019-08-05 10:13:59,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:59,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:59,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:00,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:00,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:14:00,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:14:00,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:14:00,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:14:00,018 INFO L87 Difference]: Start difference. First operand 45 states and 68 transitions. Second operand 9 states. [2019-08-05 10:14:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:00,442 INFO L93 Difference]: Finished difference Result 96 states and 151 transitions. [2019-08-05 10:14:00,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:14:00,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:14:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:00,443 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:14:00,443 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:14:00,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:14:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:14:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:14:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:14:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:14:00,445 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-08-05 10:14:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:00,445 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:14:00,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:14:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:14:00,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:14:00,450 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:14:00 BoogieIcfgContainer [2019-08-05 10:14:00,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:14:00,452 INFO L168 Benchmark]: Toolchain (without parser) took 35288.51 ms. Allocated memory was 133.7 MB in the beginning and 397.4 MB in the end (delta: 263.7 MB). Free memory was 111.2 MB in the beginning and 201.9 MB in the end (delta: -90.7 MB). Peak memory consumption was 173.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:00,453 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:14:00,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.62 ms. Allocated memory is still 133.7 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:00,454 INFO L168 Benchmark]: Boogie Preprocessor took 23.21 ms. Allocated memory is still 133.7 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:00,455 INFO L168 Benchmark]: RCFGBuilder took 469.13 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 95.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:00,456 INFO L168 Benchmark]: TraceAbstraction took 34758.26 ms. Allocated memory was 133.7 MB in the beginning and 397.4 MB in the end (delta: 263.7 MB). Free memory was 94.6 MB in the beginning and 201.9 MB in the end (delta: -107.3 MB). Peak memory consumption was 156.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:00,459 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.62 ms. Allocated memory is still 133.7 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.21 ms. Allocated memory is still 133.7 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.13 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 95.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34758.26 ms. Allocated memory was 133.7 MB in the beginning and 397.4 MB in the end (delta: 263.7 MB). Free memory was 94.6 MB in the beginning and 201.9 MB in the end (delta: -107.3 MB). Peak memory consumption was 156.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 74]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 94]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 85]: 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, 22 locations, 4 error locations. SAFE Result, 34.6s OverallTime, 46 OverallIterations, 2 TraceHistogramMax, 27.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1467 SDtfs, 4199 SDslu, 2721 SDs, 0 SdLazy, 13716 SolverSat, 1096 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 991 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=21, 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, 46 MinimizatonAttempts, 4120 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 589 ConstructedInterpolants, 19 QuantifiedInterpolants, 44690 SizeOfPredicates, 164 NumberOfNonLiveVariables, 1882 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 46 InterpolantComputations, 6 PerfectInterpolantSequences, 9/260 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...