java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:36:34,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:36:34,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:36:34,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:36:34,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:36:34,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:36:34,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:36:34,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:36:34,650 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:36:34,652 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:36:34,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:36:34,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:36:34,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:36:34,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:36:34,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:36:34,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:36:34,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:36:34,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:36:34,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:36:34,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:36:34,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:36:34,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:36:34,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:36:34,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:36:34,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:36:34,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:36:34,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:36:34,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:36:34,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:36:34,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:36:34,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:36:34,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:36:34,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:36:34,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:36:34,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:36:34,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:36:34,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:36:34,721 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:36:34,722 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:36:34,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:36:34,728 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:36:34,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:36:34,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:36:34,729 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:36:34,729 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:36:34,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:36:34,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:36:34,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:36:34,810 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:36:34,811 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:36:34,812 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-07-23 13:36:34,812 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-07-23 13:36:34,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:36:34,918 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:36:34,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:36:34,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:36:34,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:36:34,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/1) ... [2018-07-23 13:36:34,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/1) ... [2018-07-23 13:36:34,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/1) ... [2018-07-23 13:36:34,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/1) ... [2018-07-23 13:36:34,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/1) ... [2018-07-23 13:36:35,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/1) ... [2018-07-23 13:36:35,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/1) ... [2018-07-23 13:36:35,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:36:35,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:36:35,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:36:35,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:36:35,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/1) ... [2018-07-23 13:36:35,125 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-23 13:36:35,126 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-23 13:36:35,126 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-23 13:36:35,583 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:36:35,584 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:35 BoogieIcfgContainer [2018-07-23 13:36:35,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:36:35,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:36:35,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:36:35,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:36:35,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:34" (1/2) ... [2018-07-23 13:36:35,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c373e8 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:36:35, skipping insertion in model container [2018-07-23 13:36:35,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:35" (2/2) ... [2018-07-23 13:36:35,599 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-07-23 13:36:35,610 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:36:35,620 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-07-23 13:36:35,677 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:36:35,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:36:35,678 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:36:35,679 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:36:35,679 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:36:35,679 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:36:35,679 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:36:35,680 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:36:35,680 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:36:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-07-23 13:36:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:36:35,713 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:35,714 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:36:35,714 INFO L414 AbstractCegarLoop]: === Iteration 1 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:35,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1484336, now seen corresponding path program 1 times [2018-07-23 13:36:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,929 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:35,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:35,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,934 INFO L185 omatonBuilderFactory]: Interpolants [58#true, 59#false, 60#(and (<= (+ product__local__threadpooling_working_0 2) product__global_next) (<= (+ product__local__threadpooling_working_2 2) product__global_next)), 61#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)), 62#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))] [2018-07-23 13:36:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,936 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:36:35,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:36:35,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:35,957 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-07-23 13:36:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:36,691 INFO L93 Difference]: Finished difference Result 83 states and 244 transitions. [2018-07-23 13:36:36,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:36:36,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:36:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:36,730 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:36:36,730 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:36:36,735 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:36:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-07-23 13:36:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:36:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 188 transitions. [2018-07-23 13:36:36,815 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 188 transitions. Word has length 4 [2018-07-23 13:36:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:36,816 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 188 transitions. [2018-07-23 13:36:36,816 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:36:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 188 transitions. [2018-07-23 13:36:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:36:36,818 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:36,818 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:36:36,818 INFO L414 AbstractCegarLoop]: === Iteration 2 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:36,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1486647, now seen corresponding path program 1 times [2018-07-23 13:36:36,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,860 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:36,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:36,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,862 INFO L185 omatonBuilderFactory]: Interpolants [368#false, 369#(and (<= (+ product__local__threadpooling_working_2 2) product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__global_next)), 370#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 371#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 367#true] [2018-07-23 13:36:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,866 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:36:36,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:36:36,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:36,867 INFO L87 Difference]: Start difference. First operand 67 states and 188 transitions. Second operand 5 states. [2018-07-23 13:36:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:37,264 INFO L93 Difference]: Finished difference Result 141 states and 439 transitions. [2018-07-23 13:36:37,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:36:37,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:36:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:37,270 INFO L225 Difference]: With dead ends: 141 [2018-07-23 13:36:37,272 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 13:36:37,274 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 13:36:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2018-07-23 13:36:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:36:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 316 transitions. [2018-07-23 13:36:37,315 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 316 transitions. Word has length 4 [2018-07-23 13:36:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:37,316 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 316 transitions. [2018-07-23 13:36:37,316 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:36:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 316 transitions. [2018-07-23 13:36:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:36:37,319 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:37,319 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:36:37,320 INFO L414 AbstractCegarLoop]: === Iteration 3 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash 951517, now seen corresponding path program 1 times [2018-07-23 13:36:37,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:37,360 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:37,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:37,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:37,362 INFO L185 omatonBuilderFactory]: Interpolants [850#true, 851#false, 852#(and (<= (+ product__local__threadpooling_working_0 2) product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__global_next)), 853#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2))), 854#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:36:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:37,363 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:36:37,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:36:37,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:37,366 INFO L87 Difference]: Start difference. First operand 95 states and 316 transitions. Second operand 5 states. [2018-07-23 13:36:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:37,725 INFO L93 Difference]: Finished difference Result 161 states and 531 transitions. [2018-07-23 13:36:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:36:37,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:36:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:37,732 INFO L225 Difference]: With dead ends: 161 [2018-07-23 13:36:37,733 INFO L226 Difference]: Without dead ends: 157 [2018-07-23 13:36:37,734 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-23 13:36:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 115. [2018-07-23 13:36:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-23 13:36:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 408 transitions. [2018-07-23 13:36:37,780 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 408 transitions. Word has length 4 [2018-07-23 13:36:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:37,782 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 408 transitions. [2018-07-23 13:36:37,782 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:36:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 408 transitions. [2018-07-23 13:36:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:37,784 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:37,785 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:37,785 INFO L414 AbstractCegarLoop]: === Iteration 4 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1424666997, now seen corresponding path program 1 times [2018-07-23 13:36:37,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:37,816 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:37,816 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:37,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:37,818 INFO L185 omatonBuilderFactory]: Interpolants [1413#true, 1414#false, 1415#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 1416#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__global_next)), 1417#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)), 1418#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1)), 1419#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1))] [2018-07-23 13:36:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:37,818 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:37,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:37,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:37,820 INFO L87 Difference]: Start difference. First operand 115 states and 408 transitions. Second operand 7 states. [2018-07-23 13:36:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:38,769 INFO L93 Difference]: Finished difference Result 429 states and 1559 transitions. [2018-07-23 13:36:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:38,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:38,775 INFO L225 Difference]: With dead ends: 429 [2018-07-23 13:36:38,776 INFO L226 Difference]: Without dead ends: 423 [2018-07-23 13:36:38,777 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-07-23 13:36:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 197. [2018-07-23 13:36:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 13:36:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 815 transitions. [2018-07-23 13:36:38,829 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 815 transitions. Word has length 6 [2018-07-23 13:36:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:38,830 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 815 transitions. [2018-07-23 13:36:38,830 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 815 transitions. [2018-07-23 13:36:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:38,832 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:38,832 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:38,832 INFO L414 AbstractCegarLoop]: === Iteration 5 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:38,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1424667000, now seen corresponding path program 1 times [2018-07-23 13:36:38,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:38,863 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:38,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:38,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:38,864 INFO L185 omatonBuilderFactory]: Interpolants [2690#true, 2691#false, 2692#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 2693#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_end_1)) (= product__local__threadpooling_end_1 product__global_next)), 2694#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_end_1)) (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)), 2695#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 2696#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:36:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:38,865 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:38,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:38,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:38,866 INFO L87 Difference]: Start difference. First operand 197 states and 815 transitions. Second operand 7 states. [2018-07-23 13:36:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:39,864 INFO L93 Difference]: Finished difference Result 469 states and 1652 transitions. [2018-07-23 13:36:39,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:36:39,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:39,869 INFO L225 Difference]: With dead ends: 469 [2018-07-23 13:36:39,869 INFO L226 Difference]: Without dead ends: 463 [2018-07-23 13:36:39,871 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:36:39,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-07-23 13:36:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 221. [2018-07-23 13:36:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 13:36:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 931 transitions. [2018-07-23 13:36:39,948 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 931 transitions. Word has length 6 [2018-07-23 13:36:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:39,949 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 931 transitions. [2018-07-23 13:36:39,949 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 931 transitions. [2018-07-23 13:36:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:39,951 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:39,951 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:39,953 INFO L414 AbstractCegarLoop]: === Iteration 6 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1424683768, now seen corresponding path program 1 times [2018-07-23 13:36:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:39,985 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:39,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:39,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:39,987 INFO L185 omatonBuilderFactory]: Interpolants [4099#true, 4100#false, 4101#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 4102#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__global_next)), 4103#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)), 4104#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)), 4105#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1))] [2018-07-23 13:36:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:39,987 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:39,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:39,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:39,989 INFO L87 Difference]: Start difference. First operand 221 states and 931 transitions. Second operand 7 states. [2018-07-23 13:36:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:40,866 INFO L93 Difference]: Finished difference Result 425 states and 1563 transitions. [2018-07-23 13:36:40,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:40,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:40,871 INFO L225 Difference]: With dead ends: 425 [2018-07-23 13:36:40,871 INFO L226 Difference]: Without dead ends: 419 [2018-07-23 13:36:40,872 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-07-23 13:36:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 235. [2018-07-23 13:36:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-23 13:36:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 1000 transitions. [2018-07-23 13:36:40,957 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 1000 transitions. Word has length 6 [2018-07-23 13:36:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:40,958 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 1000 transitions. [2018-07-23 13:36:40,958 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 1000 transitions. [2018-07-23 13:36:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:40,960 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:40,960 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:40,960 INFO L414 AbstractCegarLoop]: === Iteration 7 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1424683771, now seen corresponding path program 1 times [2018-07-23 13:36:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:40,995 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:40,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:40,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:40,997 INFO L185 omatonBuilderFactory]: Interpolants [5444#true, 5445#false, 5446#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 5447#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_end_1)) (= product__local__threadpooling_end_1 product__global_next)), 5448#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_end_1)) (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)), 5449#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_end_1)) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)), 5450#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:36:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:40,997 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:40,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:40,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:40,998 INFO L87 Difference]: Start difference. First operand 235 states and 1000 transitions. Second operand 7 states. [2018-07-23 13:36:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:41,793 INFO L93 Difference]: Finished difference Result 461 states and 1684 transitions. [2018-07-23 13:36:41,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:41,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:41,798 INFO L225 Difference]: With dead ends: 461 [2018-07-23 13:36:41,799 INFO L226 Difference]: Without dead ends: 455 [2018-07-23 13:36:41,800 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:36:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-07-23 13:36:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 233. [2018-07-23 13:36:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-23 13:36:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 991 transitions. [2018-07-23 13:36:41,873 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 991 transitions. Word has length 6 [2018-07-23 13:36:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:41,873 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 991 transitions. [2018-07-23 13:36:41,873 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 991 transitions. [2018-07-23 13:36:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:41,877 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:41,877 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:41,878 INFO L414 AbstractCegarLoop]: === Iteration 8 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1411058392, now seen corresponding path program 1 times [2018-07-23 13:36:41,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:41,914 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:41,915 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:41,916 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:41,916 INFO L185 omatonBuilderFactory]: Interpolants [6855#true, 6856#false, 6857#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 6858#(and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_1))), 6859#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_1))), 6860#(and (= product__local__threadpooling_end_1 product__local__threadpooling_working_2) (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_1))), 6861#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:36:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:41,917 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:41,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:41,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:41,921 INFO L87 Difference]: Start difference. First operand 233 states and 991 transitions. Second operand 7 states. [2018-07-23 13:36:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:42,591 INFO L93 Difference]: Finished difference Result 517 states and 1983 transitions. [2018-07-23 13:36:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:42,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:42,597 INFO L225 Difference]: With dead ends: 517 [2018-07-23 13:36:42,597 INFO L226 Difference]: Without dead ends: 511 [2018-07-23 13:36:42,598 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:36:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-07-23 13:36:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 302. [2018-07-23 13:36:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-07-23 13:36:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1335 transitions. [2018-07-23 13:36:42,676 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1335 transitions. Word has length 6 [2018-07-23 13:36:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:42,677 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 1335 transitions. [2018-07-23 13:36:42,677 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1335 transitions. [2018-07-23 13:36:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:42,678 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:42,678 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:42,679 INFO L414 AbstractCegarLoop]: === Iteration 9 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:42,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1411058395, now seen corresponding path program 1 times [2018-07-23 13:36:42,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:42,699 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:42,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:42,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:42,700 INFO L185 omatonBuilderFactory]: Interpolants [8516#true, 8517#false, 8518#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 8519#(and (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 8520#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 8521#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__local__threadpooling_working_2) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 8522#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))] [2018-07-23 13:36:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:42,701 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:42,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:42,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:42,702 INFO L87 Difference]: Start difference. First operand 302 states and 1335 transitions. Second operand 7 states. [2018-07-23 13:36:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:43,291 INFO L93 Difference]: Finished difference Result 728 states and 3098 transitions. [2018-07-23 13:36:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:43,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:43,297 INFO L225 Difference]: With dead ends: 728 [2018-07-23 13:36:43,297 INFO L226 Difference]: Without dead ends: 427 [2018-07-23 13:36:43,302 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:36:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-07-23 13:36:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 343. [2018-07-23 13:36:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-07-23 13:36:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1474 transitions. [2018-07-23 13:36:43,413 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1474 transitions. Word has length 6 [2018-07-23 13:36:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:43,414 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 1474 transitions. [2018-07-23 13:36:43,414 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1474 transitions. [2018-07-23 13:36:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:43,415 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:43,416 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:43,417 INFO L414 AbstractCegarLoop]: === Iteration 10 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1411063073, now seen corresponding path program 1 times [2018-07-23 13:36:43,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:43,450 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:43,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:43,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:43,451 INFO L185 omatonBuilderFactory]: Interpolants [10681#true, 10682#false, 10683#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 10684#(and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_1))), 10685#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_1))), 10686#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2))), 10687#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:36:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:43,452 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:43,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:43,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:43,453 INFO L87 Difference]: Start difference. First operand 343 states and 1474 transitions. Second operand 7 states. [2018-07-23 13:36:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:44,285 INFO L93 Difference]: Finished difference Result 595 states and 2261 transitions. [2018-07-23 13:36:44,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:36:44,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:44,292 INFO L225 Difference]: With dead ends: 595 [2018-07-23 13:36:44,292 INFO L226 Difference]: Without dead ends: 589 [2018-07-23 13:36:44,293 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:36:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-07-23 13:36:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 364. [2018-07-23 13:36:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-07-23 13:36:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 1580 transitions. [2018-07-23 13:36:44,404 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 1580 transitions. Word has length 6 [2018-07-23 13:36:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:44,405 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 1580 transitions. [2018-07-23 13:36:44,405 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 1580 transitions. [2018-07-23 13:36:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:44,406 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:44,406 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:44,406 INFO L414 AbstractCegarLoop]: === Iteration 11 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1411063076, now seen corresponding path program 1 times [2018-07-23 13:36:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:44,425 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:44,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:44,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:44,426 INFO L185 omatonBuilderFactory]: Interpolants [12628#true, 12629#false, 12630#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 12631#(and (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 12632#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 12633#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)), 12634#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))] [2018-07-23 13:36:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:44,427 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:44,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:44,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:44,428 INFO L87 Difference]: Start difference. First operand 364 states and 1580 transitions. Second operand 7 states. [2018-07-23 13:36:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:45,033 INFO L93 Difference]: Finished difference Result 516 states and 2071 transitions. [2018-07-23 13:36:45,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:45,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:45,040 INFO L225 Difference]: With dead ends: 516 [2018-07-23 13:36:45,040 INFO L226 Difference]: Without dead ends: 510 [2018-07-23 13:36:45,041 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:36:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-07-23 13:36:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 368. [2018-07-23 13:36:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-07-23 13:36:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 1600 transitions. [2018-07-23 13:36:45,157 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 1600 transitions. Word has length 6 [2018-07-23 13:36:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:45,158 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 1600 transitions. [2018-07-23 13:36:45,158 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 1600 transitions. [2018-07-23 13:36:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:45,159 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:45,159 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:45,160 INFO L414 AbstractCegarLoop]: === Iteration 12 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1426049868, now seen corresponding path program 1 times [2018-07-23 13:36:45,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:45,182 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:45,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:45,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:45,183 INFO L185 omatonBuilderFactory]: Interpolants [14419#true, 14420#false, 14421#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 14422#(and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_1))), 14423#(and (not (= product__local__threadpooling_working_1 product__global_next)) (not (= product__local__threadpooling_working_0 product__global_next))), 14424#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2))), 14425#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:36:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:45,184 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:45,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:45,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:45,186 INFO L87 Difference]: Start difference. First operand 368 states and 1600 transitions. Second operand 7 states. [2018-07-23 13:36:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:45,932 INFO L93 Difference]: Finished difference Result 577 states and 2252 transitions. [2018-07-23 13:36:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:36:45,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:45,939 INFO L225 Difference]: With dead ends: 577 [2018-07-23 13:36:45,939 INFO L226 Difference]: Without dead ends: 571 [2018-07-23 13:36:45,940 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:36:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-07-23 13:36:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 366. [2018-07-23 13:36:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-07-23 13:36:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1577 transitions. [2018-07-23 13:36:46,078 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1577 transitions. Word has length 6 [2018-07-23 13:36:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:46,078 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 1577 transitions. [2018-07-23 13:36:46,079 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1577 transitions. [2018-07-23 13:36:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:46,080 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:46,080 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:46,080 INFO L414 AbstractCegarLoop]: === Iteration 13 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1426049871, now seen corresponding path program 1 times [2018-07-23 13:36:46,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:46,106 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:46,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:46,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:46,110 INFO L185 omatonBuilderFactory]: Interpolants [16336#true, 16337#false, 16338#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 16339#(and (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 16340#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1) (not (= product__local__threadpooling_working_1 product__global_next))), 16341#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)), 16342#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))] [2018-07-23 13:36:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:46,110 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:46,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:46,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:46,111 INFO L87 Difference]: Start difference. First operand 366 states and 1577 transitions. Second operand 7 states. [2018-07-23 13:36:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:46,818 INFO L93 Difference]: Finished difference Result 546 states and 2186 transitions. [2018-07-23 13:36:46,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:46,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:46,824 INFO L225 Difference]: With dead ends: 546 [2018-07-23 13:36:46,824 INFO L226 Difference]: Without dead ends: 540 [2018-07-23 13:36:46,825 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-07-23 13:36:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 382. [2018-07-23 13:36:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-07-23 13:36:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1649 transitions. [2018-07-23 13:36:46,974 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1649 transitions. Word has length 6 [2018-07-23 13:36:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:46,974 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 1649 transitions. [2018-07-23 13:36:46,977 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1649 transitions. [2018-07-23 13:36:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:46,978 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:46,978 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:46,979 INFO L414 AbstractCegarLoop]: === Iteration 14 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1426468872, now seen corresponding path program 1 times [2018-07-23 13:36:46,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:46,997 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:46,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:46,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:46,998 INFO L185 omatonBuilderFactory]: Interpolants [18217#true, 18218#false, 18219#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 18220#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__global_next)), 18221#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1) (not (= product__local__threadpooling_working_1 product__global_next))), 18222#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1)), 18223#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1))] [2018-07-23 13:36:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:46,998 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:46,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:46,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:46,999 INFO L87 Difference]: Start difference. First operand 382 states and 1649 transitions. Second operand 7 states. [2018-07-23 13:36:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:47,852 INFO L93 Difference]: Finished difference Result 607 states and 2405 transitions. [2018-07-23 13:36:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:47,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:47,859 INFO L225 Difference]: With dead ends: 607 [2018-07-23 13:36:47,859 INFO L226 Difference]: Without dead ends: 601 [2018-07-23 13:36:47,860 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:36:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-07-23 13:36:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 388. [2018-07-23 13:36:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-07-23 13:36:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1668 transitions. [2018-07-23 13:36:48,006 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1668 transitions. Word has length 6 [2018-07-23 13:36:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:48,006 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 1668 transitions. [2018-07-23 13:36:48,007 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1668 transitions. [2018-07-23 13:36:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:48,008 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:48,008 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:48,008 INFO L414 AbstractCegarLoop]: === Iteration 15 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:48,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1426468875, now seen corresponding path program 1 times [2018-07-23 13:36:48,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:48,029 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:48,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:48,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:48,030 INFO L185 omatonBuilderFactory]: Interpolants [20230#true, 20231#false, 20232#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 20233#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_end_1)) (= product__local__threadpooling_end_1 product__global_next)), 20234#(and (not (= product__local__threadpooling_working_1 product__global_next)) (not (= product__local__threadpooling_working_2 product__global_next))), 20235#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 20236#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:36:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:48,031 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:48,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:48,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:48,032 INFO L87 Difference]: Start difference. First operand 388 states and 1668 transitions. Second operand 7 states. [2018-07-23 13:36:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:48,850 INFO L93 Difference]: Finished difference Result 635 states and 2531 transitions. [2018-07-23 13:36:48,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:36:48,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:48,858 INFO L225 Difference]: With dead ends: 635 [2018-07-23 13:36:48,858 INFO L226 Difference]: Without dead ends: 629 [2018-07-23 13:36:48,859 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:36:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-07-23 13:36:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 394. [2018-07-23 13:36:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-07-23 13:36:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1695 transitions. [2018-07-23 13:36:49,046 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1695 transitions. Word has length 6 [2018-07-23 13:36:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:49,046 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 1695 transitions. [2018-07-23 13:36:49,046 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1695 transitions. [2018-07-23 13:36:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:49,047 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:49,047 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:49,047 INFO L414 AbstractCegarLoop]: === Iteration 16 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1418563998, now seen corresponding path program 1 times [2018-07-23 13:36:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:49,098 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:49,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:49,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:49,104 INFO L185 omatonBuilderFactory]: Interpolants [22320#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 22321#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_i_0 product__local__threadpooling_i_2))), 22322#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2))), 22323#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 22317#true, 22318#false, 22319#(<= (+ product__local__threadpooling_working_1 2) product__global_next)] [2018-07-23 13:36:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:49,105 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:49,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:49,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:49,106 INFO L87 Difference]: Start difference. First operand 394 states and 1695 transitions. Second operand 7 states. [2018-07-23 13:36:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:49,844 INFO L93 Difference]: Finished difference Result 811 states and 3241 transitions. [2018-07-23 13:36:49,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:49,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:49,860 INFO L225 Difference]: With dead ends: 811 [2018-07-23 13:36:49,860 INFO L226 Difference]: Without dead ends: 805 [2018-07-23 13:36:49,861 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-07-23 13:36:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 455. [2018-07-23 13:36:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-07-23 13:36:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 2000 transitions. [2018-07-23 13:36:50,048 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 2000 transitions. Word has length 6 [2018-07-23 13:36:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:50,049 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 2000 transitions. [2018-07-23 13:36:50,049 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 2000 transitions. [2018-07-23 13:36:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:50,050 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:50,050 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:50,050 INFO L414 AbstractCegarLoop]: === Iteration 17 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:50,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1418563871, now seen corresponding path program 1 times [2018-07-23 13:36:50,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:50,072 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:50,072 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:50,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:50,073 INFO L185 omatonBuilderFactory]: Interpolants [24880#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 24874#true, 24875#false, 24876#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 24877#(and (<= (+ product__local__threadpooling_working_1 3) product__global_next) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 24878#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_i_0 product__local__threadpooling_i_2))), 24879#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)))] [2018-07-23 13:36:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:50,073 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:50,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:50,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:50,074 INFO L87 Difference]: Start difference. First operand 455 states and 2000 transitions. Second operand 7 states. [2018-07-23 13:36:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:50,822 INFO L93 Difference]: Finished difference Result 829 states and 3301 transitions. [2018-07-23 13:36:50,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:36:50,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:50,831 INFO L225 Difference]: With dead ends: 829 [2018-07-23 13:36:50,832 INFO L226 Difference]: Without dead ends: 823 [2018-07-23 13:36:50,833 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:36:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-07-23 13:36:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 480. [2018-07-23 13:36:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-07-23 13:36:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 2125 transitions. [2018-07-23 13:36:51,038 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 2125 transitions. Word has length 6 [2018-07-23 13:36:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:51,039 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 2125 transitions. [2018-07-23 13:36:51,039 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 2125 transitions. [2018-07-23 13:36:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:51,040 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:51,040 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:51,040 INFO L414 AbstractCegarLoop]: === Iteration 18 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1418567253, now seen corresponding path program 1 times [2018-07-23 13:36:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:51,064 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:51,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:51,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:51,065 INFO L185 omatonBuilderFactory]: Interpolants [27520#false, 27521#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 27522#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 27523#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_i_0 product__local__threadpooling_i_2))), 27524#(and (not (= product__local__threadpooling_i_0 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 27525#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 27519#true] [2018-07-23 13:36:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:51,066 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:51,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:51,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:51,067 INFO L87 Difference]: Start difference. First operand 480 states and 2125 transitions. Second operand 7 states. [2018-07-23 13:36:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:51,996 INFO L93 Difference]: Finished difference Result 858 states and 3471 transitions. [2018-07-23 13:36:51,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:51,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:52,004 INFO L225 Difference]: With dead ends: 858 [2018-07-23 13:36:52,005 INFO L226 Difference]: Without dead ends: 852 [2018-07-23 13:36:52,006 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-07-23 13:36:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 502. [2018-07-23 13:36:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-07-23 13:36:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 2231 transitions. [2018-07-23 13:36:52,222 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 2231 transitions. Word has length 6 [2018-07-23 13:36:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:52,222 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 2231 transitions. [2018-07-23 13:36:52,222 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 2231 transitions. [2018-07-23 13:36:52,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:52,223 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:52,224 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:52,224 INFO L414 AbstractCegarLoop]: === Iteration 19 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:52,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1418567126, now seen corresponding path program 1 times [2018-07-23 13:36:52,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:52,243 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:52,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:52,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:52,244 INFO L185 omatonBuilderFactory]: Interpolants [30264#true, 30265#false, 30266#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 30267#(and (<= (+ product__local__threadpooling_working_1 3) product__global_next) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 30268#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_i_0 product__local__threadpooling_i_2))), 30269#(and (not (= product__local__threadpooling_i_0 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2))), 30270#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:36:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:52,245 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:52,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:52,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:52,246 INFO L87 Difference]: Start difference. First operand 502 states and 2231 transitions. Second operand 7 states. [2018-07-23 13:36:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:52,971 INFO L93 Difference]: Finished difference Result 868 states and 3505 transitions. [2018-07-23 13:36:52,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:52,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:52,981 INFO L225 Difference]: With dead ends: 868 [2018-07-23 13:36:52,981 INFO L226 Difference]: Without dead ends: 862 [2018-07-23 13:36:52,983 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2018-07-23 13:36:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 516. [2018-07-23 13:36:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-07-23 13:36:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 2303 transitions. [2018-07-23 13:36:53,216 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 2303 transitions. Word has length 6 [2018-07-23 13:36:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:53,217 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 2303 transitions. [2018-07-23 13:36:53,217 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 2303 transitions. [2018-07-23 13:36:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:53,218 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:53,218 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:53,218 INFO L414 AbstractCegarLoop]: === Iteration 20 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:53,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1418649215, now seen corresponding path program 1 times [2018-07-23 13:36:53,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:53,242 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:53,242 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:53,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:53,243 INFO L185 omatonBuilderFactory]: Interpolants [33056#(and (<= (+ product__local__threadpooling_working_2 3) product__global_next) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 33057#(and (<= (+ product__local__threadpooling_i_0 1) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_i_1)), 33058#(and (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_working_1) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 33059#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_working_1)), 33053#true, 33054#false, 33055#(<= (+ product__local__threadpooling_working_2 2) product__global_next)] [2018-07-23 13:36:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:53,244 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:53,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:53,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:53,247 INFO L87 Difference]: Start difference. First operand 516 states and 2303 transitions. Second operand 7 states. [2018-07-23 13:36:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:54,077 INFO L93 Difference]: Finished difference Result 903 states and 3839 transitions. [2018-07-23 13:36:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:36:54,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:54,087 INFO L225 Difference]: With dead ends: 903 [2018-07-23 13:36:54,087 INFO L226 Difference]: Without dead ends: 897 [2018-07-23 13:36:54,088 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-07-23 13:36:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 579. [2018-07-23 13:36:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-07-23 13:36:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 2625 transitions. [2018-07-23 13:36:54,359 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 2625 transitions. Word has length 6 [2018-07-23 13:36:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:54,359 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 2625 transitions. [2018-07-23 13:36:54,360 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 2625 transitions. [2018-07-23 13:36:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:54,361 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:54,361 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:54,361 INFO L414 AbstractCegarLoop]: === Iteration 21 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1418649218, now seen corresponding path program 1 times [2018-07-23 13:36:54,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:54,381 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:54,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:54,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:54,381 INFO L185 omatonBuilderFactory]: Interpolants [36036#true, 36037#false, 36038#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 36039#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 36040#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_i_0 1) product__local__threadpooling_i_1)), 36041#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 36042#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:36:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:54,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:54,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:54,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:54,383 INFO L87 Difference]: Start difference. First operand 579 states and 2625 transitions. Second operand 7 states. [2018-07-23 13:36:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:55,267 INFO L93 Difference]: Finished difference Result 926 states and 3876 transitions. [2018-07-23 13:36:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:55,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:55,278 INFO L225 Difference]: With dead ends: 926 [2018-07-23 13:36:55,278 INFO L226 Difference]: Without dead ends: 920 [2018-07-23 13:36:55,279 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:36:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-07-23 13:36:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 585. [2018-07-23 13:36:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-07-23 13:36:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 2647 transitions. [2018-07-23 13:36:55,632 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 2647 transitions. Word has length 6 [2018-07-23 13:36:55,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:55,632 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 2647 transitions. [2018-07-23 13:36:55,632 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 2647 transitions. [2018-07-23 13:36:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:55,634 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:55,634 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:55,634 INFO L414 AbstractCegarLoop]: === Iteration 22 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1418665986, now seen corresponding path program 1 times [2018-07-23 13:36:55,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:55,662 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:55,662 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:55,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:55,662 INFO L185 omatonBuilderFactory]: Interpolants [39081#true, 39082#false, 39083#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 39084#(and (<= (+ product__local__threadpooling_working_2 3) product__global_next) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 39085#(and (<= (+ product__local__threadpooling_i_0 1) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_i_1)), 39086#(and (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_1)), 39087#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_working_1))] [2018-07-23 13:36:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:55,663 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:55,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:55,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:55,664 INFO L87 Difference]: Start difference. First operand 585 states and 2647 transitions. Second operand 7 states. [2018-07-23 13:36:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:56,598 INFO L93 Difference]: Finished difference Result 970 states and 4136 transitions. [2018-07-23 13:36:56,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:36:56,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:56,625 INFO L225 Difference]: With dead ends: 970 [2018-07-23 13:36:56,625 INFO L226 Difference]: Without dead ends: 964 [2018-07-23 13:36:56,628 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:36:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-07-23 13:36:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 632. [2018-07-23 13:36:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-07-23 13:36:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 2880 transitions. [2018-07-23 13:36:56,925 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 2880 transitions. Word has length 6 [2018-07-23 13:36:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:56,925 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 2880 transitions. [2018-07-23 13:36:56,925 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 2880 transitions. [2018-07-23 13:36:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:56,926 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:56,927 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:56,927 INFO L414 AbstractCegarLoop]: === Iteration 23 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:56,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1418665989, now seen corresponding path program 1 times [2018-07-23 13:36:56,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,942 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:56,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:56,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,943 INFO L185 omatonBuilderFactory]: Interpolants [42312#true, 42313#false, 42314#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 42315#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 42316#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_i_0 1) product__local__threadpooling_i_1)), 42317#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_1)), 42318#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:36:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:56,943 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:56,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:56,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:56,944 INFO L87 Difference]: Start difference. First operand 632 states and 2880 transitions. Second operand 7 states. [2018-07-23 13:36:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:57,972 INFO L93 Difference]: Finished difference Result 1022 states and 4311 transitions. [2018-07-23 13:36:57,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:57,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:57,978 INFO L225 Difference]: With dead ends: 1022 [2018-07-23 13:36:57,978 INFO L226 Difference]: Without dead ends: 1016 [2018-07-23 13:36:57,979 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-07-23 13:36:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 601. [2018-07-23 13:36:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-07-23 13:36:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2724 transitions. [2018-07-23 13:36:58,313 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2724 transitions. Word has length 6 [2018-07-23 13:36:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:58,314 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 2724 transitions. [2018-07-23 13:36:58,314 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2724 transitions. [2018-07-23 13:36:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:58,315 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,315 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,315 INFO L414 AbstractCegarLoop]: === Iteration 24 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1428529568, now seen corresponding path program 1 times [2018-07-23 13:36:58,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,331 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:58,331 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:58,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,332 INFO L185 omatonBuilderFactory]: Interpolants [45584#false, 45585#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 45586#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 45587#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_0 1) product__global_next)), 45588#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_2)), 45589#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 45583#true] [2018-07-23 13:36:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:58,332 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:58,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:58,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:58,333 INFO L87 Difference]: Start difference. First operand 601 states and 2724 transitions. Second operand 7 states. [2018-07-23 13:36:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:59,181 INFO L93 Difference]: Finished difference Result 1015 states and 4266 transitions. [2018-07-23 13:36:59,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:36:59,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:36:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:59,188 INFO L225 Difference]: With dead ends: 1015 [2018-07-23 13:36:59,189 INFO L226 Difference]: Without dead ends: 1009 [2018-07-23 13:36:59,190 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:36:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-07-23 13:36:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 605. [2018-07-23 13:36:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-07-23 13:36:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 2740 transitions. [2018-07-23 13:36:59,496 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 2740 transitions. Word has length 6 [2018-07-23 13:36:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:59,496 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 2740 transitions. [2018-07-23 13:36:59,496 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 2740 transitions. [2018-07-23 13:36:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:59,497 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:59,497 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:59,498 INFO L414 AbstractCegarLoop]: === Iteration 25 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:59,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1428529441, now seen corresponding path program 1 times [2018-07-23 13:36:59,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,508 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:59,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:59,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,509 INFO L185 omatonBuilderFactory]: Interpolants [48850#true, 48851#false, 48852#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 48853#(and (<= (+ product__local__threadpooling_working_1 3) product__global_next) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 48854#(and (<= (+ product__local__threadpooling_working_1 3) product__global_next) (<= (+ product__local__threadpooling_working_0 1) product__global_next)), 48855#(and (<= (+ product__local__threadpooling_working_1 3) product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_2)), 48856#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 3) product__local__threadpooling_working_2))] [2018-07-23 13:36:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:59,510 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:59,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:59,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:59,510 INFO L87 Difference]: Start difference. First operand 605 states and 2740 transitions. Second operand 7 states. [2018-07-23 13:37:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,165 INFO L93 Difference]: Finished difference Result 859 states and 3697 transitions. [2018-07-23 13:37:00,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:00,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,171 INFO L225 Difference]: With dead ends: 859 [2018-07-23 13:37:00,171 INFO L226 Difference]: Without dead ends: 853 [2018-07-23 13:37:00,172 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-07-23 13:37:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 678. [2018-07-23 13:37:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-07-23 13:37:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 3106 transitions. [2018-07-23 13:37:00,446 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 3106 transitions. Word has length 6 [2018-07-23 13:37:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:00,446 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 3106 transitions. [2018-07-23 13:37:00,446 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 3106 transitions. [2018-07-23 13:37:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:00,447 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:00,447 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:00,448 INFO L414 AbstractCegarLoop]: === Iteration 26 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1428684411, now seen corresponding path program 1 times [2018-07-23 13:37:00,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,464 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:00,464 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:00,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,464 INFO L185 omatonBuilderFactory]: Interpolants [51941#true, 51942#false, 51943#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 51944#(and (<= (+ product__local__threadpooling_working_2 3) product__global_next) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 51945#(and (<= (+ product__local__threadpooling_working_0 1) product__global_next) (<= (+ product__local__threadpooling_working_2 3) product__global_next)), 51946#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))), 51947#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)))] [2018-07-23 13:37:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:00,465 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:00,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:00,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:00,465 INFO L87 Difference]: Start difference. First operand 678 states and 3106 transitions. Second operand 7 states. [2018-07-23 13:37:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:01,351 INFO L93 Difference]: Finished difference Result 1205 states and 5205 transitions. [2018-07-23 13:37:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:01,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:01,357 INFO L225 Difference]: With dead ends: 1205 [2018-07-23 13:37:01,358 INFO L226 Difference]: Without dead ends: 1199 [2018-07-23 13:37:01,358 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2018-07-23 13:37:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 769. [2018-07-23 13:37:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-07-23 13:37:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3553 transitions. [2018-07-23 13:37:01,695 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3553 transitions. Word has length 6 [2018-07-23 13:37:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,695 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 3553 transitions. [2018-07-23 13:37:01,695 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3553 transitions. [2018-07-23 13:37:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:01,697 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,697 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,697 INFO L414 AbstractCegarLoop]: === Iteration 27 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1428684414, now seen corresponding path program 1 times [2018-07-23 13:37:01,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,708 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:01,708 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:01,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,709 INFO L185 omatonBuilderFactory]: Interpolants [55920#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 55914#true, 55915#false, 55916#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 55917#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_i_0 1) product__global_next)), 55918#(and (<= (+ product__local__threadpooling_working_0 1) product__global_next) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 55919#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)))] [2018-07-23 13:37:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:01,709 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:01,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:01,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:01,710 INFO L87 Difference]: Start difference. First operand 769 states and 3553 transitions. Second operand 7 states. [2018-07-23 13:37:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:02,540 INFO L93 Difference]: Finished difference Result 1153 states and 4942 transitions. [2018-07-23 13:37:02,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:02,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:02,546 INFO L225 Difference]: With dead ends: 1153 [2018-07-23 13:37:02,546 INFO L226 Difference]: Without dead ends: 1147 [2018-07-23 13:37:02,547 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2018-07-23 13:37:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 769. [2018-07-23 13:37:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-07-23 13:37:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3545 transitions. [2018-07-23 13:37:02,873 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3545 transitions. Word has length 6 [2018-07-23 13:37:02,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:02,873 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 3545 transitions. [2018-07-23 13:37:02,874 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3545 transitions. [2018-07-23 13:37:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:02,874 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:02,874 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:37:02,875 INFO L414 AbstractCegarLoop]: === Iteration 28 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:02,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1428686967, now seen corresponding path program 1 times [2018-07-23 13:37:02,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,880 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:02,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:37:02,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,881 INFO L185 omatonBuilderFactory]: Interpolants [59785#true, 59786#false, 59787#(<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1)), 59788#(<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)] [2018-07-23 13:37:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:02,882 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:37:02,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:37:02,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:37:02,882 INFO L87 Difference]: Start difference. First operand 769 states and 3545 transitions. Second operand 4 states. [2018-07-23 13:37:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,327 INFO L93 Difference]: Finished difference Result 1263 states and 5677 transitions. [2018-07-23 13:37:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:37:03,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:37:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,332 INFO L225 Difference]: With dead ends: 1263 [2018-07-23 13:37:03,332 INFO L226 Difference]: Without dead ends: 744 [2018-07-23 13:37:03,333 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:37:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-07-23 13:37:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 636. [2018-07-23 13:37:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-07-23 13:37:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2815 transitions. [2018-07-23 13:37:03,627 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2815 transitions. Word has length 6 [2018-07-23 13:37:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:03,627 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 2815 transitions. [2018-07-23 13:37:03,627 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:37:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2815 transitions. [2018-07-23 13:37:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:03,628 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:03,628 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:37:03,629 INFO L414 AbstractCegarLoop]: === Iteration 29 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash 914427184, now seen corresponding path program 1 times [2018-07-23 13:37:03,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,634 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:03,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:37:03,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,635 INFO L185 omatonBuilderFactory]: Interpolants [63587#true, 63588#false, 63589#(<= product__local__threadpooling_end_2 (+ product__local__threadpooling_i_2 1)), 63590#(<= product__local__threadpooling_end_2 product__local__threadpooling_i_2)] [2018-07-23 13:37:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:03,635 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:37:03,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:37:03,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:37:03,636 INFO L87 Difference]: Start difference. First operand 636 states and 2815 transitions. Second operand 4 states. [2018-07-23 13:37:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:03,961 INFO L93 Difference]: Finished difference Result 1102 states and 4727 transitions. [2018-07-23 13:37:03,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:37:03,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:37:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:03,965 INFO L225 Difference]: With dead ends: 1102 [2018-07-23 13:37:03,965 INFO L226 Difference]: Without dead ends: 808 [2018-07-23 13:37:03,966 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:37:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-07-23 13:37:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 633. [2018-07-23 13:37:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-07-23 13:37:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 2754 transitions. [2018-07-23 13:37:04,219 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 2754 transitions. Word has length 6 [2018-07-23 13:37:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,219 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 2754 transitions. [2018-07-23 13:37:04,219 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:37:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 2754 transitions. [2018-07-23 13:37:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:04,220 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,220 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,220 INFO L414 AbstractCegarLoop]: === Iteration 30 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:04,220 INFO L82 PathProgramCache]: Analyzing trace with hash 914429929, now seen corresponding path program 1 times [2018-07-23 13:37:04,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,233 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:04,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:04,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,234 INFO L185 omatonBuilderFactory]: Interpolants [67061#true, 67063#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 67062#false, 67065#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__global_next))), 67064#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__global_next) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2))), 67067#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 67066#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:37:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:04,234 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:04,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:04,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:04,235 INFO L87 Difference]: Start difference. First operand 633 states and 2754 transitions. Second operand 7 states. [2018-07-23 13:37:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:05,191 INFO L93 Difference]: Finished difference Result 1150 states and 4682 transitions. [2018-07-23 13:37:05,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:05,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:05,198 INFO L225 Difference]: With dead ends: 1150 [2018-07-23 13:37:05,198 INFO L226 Difference]: Without dead ends: 1144 [2018-07-23 13:37:05,200 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-07-23 13:37:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 718. [2018-07-23 13:37:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-07-23 13:37:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 3142 transitions. [2018-07-23 13:37:05,637 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 3142 transitions. Word has length 6 [2018-07-23 13:37:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:05,637 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 3142 transitions. [2018-07-23 13:37:05,637 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 3142 transitions. [2018-07-23 13:37:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:05,638 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:05,638 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:05,638 INFO L414 AbstractCegarLoop]: === Iteration 31 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash 914429932, now seen corresponding path program 1 times [2018-07-23 13:37:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,660 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:05,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:05,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,661 INFO L185 omatonBuilderFactory]: Interpolants [70825#false, 70824#true, 70827#(and (or (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__global_next)), 70826#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 70829#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))), 70828#(and (not (= product__local__threadpooling_working_2 product__global_next)) (not (= product__local__threadpooling_working_0 product__global_next))), 70830#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)))] [2018-07-23 13:37:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:05,661 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:05,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:05,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:05,662 INFO L87 Difference]: Start difference. First operand 718 states and 3142 transitions. Second operand 7 states. [2018-07-23 13:37:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:06,849 INFO L93 Difference]: Finished difference Result 1204 states and 4985 transitions. [2018-07-23 13:37:06,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:06,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:06,856 INFO L225 Difference]: With dead ends: 1204 [2018-07-23 13:37:06,856 INFO L226 Difference]: Without dead ends: 1198 [2018-07-23 13:37:06,857 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-07-23 13:37:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 786. [2018-07-23 13:37:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2018-07-23 13:37:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3422 transitions. [2018-07-23 13:37:07,263 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3422 transitions. Word has length 6 [2018-07-23 13:37:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:07,264 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 3422 transitions. [2018-07-23 13:37:07,264 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3422 transitions. [2018-07-23 13:37:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:07,265 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:07,265 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:07,266 INFO L414 AbstractCegarLoop]: === Iteration 32 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash 914927334, now seen corresponding path program 1 times [2018-07-23 13:37:07,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,282 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:07,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:07,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,283 INFO L185 omatonBuilderFactory]: Interpolants [74833#true, 74835#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 74834#false, 74837#(and (not (= product__local__threadpooling_working_1 product__global_next)) (not (= product__local__threadpooling_working_2 product__global_next))), 74836#(and (or (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_1 product__local__threadpooling_end_2))) (or (and (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)) (= product__local__threadpooling_end_2 product__global_next)) (= product__local__threadpooling_working_1 product__local__threadpooling_end_2))), 74839#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 74838#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)))] [2018-07-23 13:37:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:07,283 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:07,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:07,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:07,284 INFO L87 Difference]: Start difference. First operand 786 states and 3422 transitions. Second operand 7 states. [2018-07-23 13:37:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:08,326 INFO L93 Difference]: Finished difference Result 1233 states and 5154 transitions. [2018-07-23 13:37:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:08,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:08,333 INFO L225 Difference]: With dead ends: 1233 [2018-07-23 13:37:08,333 INFO L226 Difference]: Without dead ends: 1227 [2018-07-23 13:37:08,334 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-07-23 13:37:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 840. [2018-07-23 13:37:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-07-23 13:37:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 3652 transitions. [2018-07-23 13:37:08,984 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 3652 transitions. Word has length 6 [2018-07-23 13:37:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:08,985 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 3652 transitions. [2018-07-23 13:37:08,985 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 3652 transitions. [2018-07-23 13:37:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:08,986 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:08,986 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:08,986 INFO L414 AbstractCegarLoop]: === Iteration 33 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash 914927207, now seen corresponding path program 1 times [2018-07-23 13:37:08,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,000 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:09,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:09,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,000 INFO L185 omatonBuilderFactory]: Interpolants [79011#false, 79010#true, 79013#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)) (= product__local__threadpooling_end_2 product__global_next)), 79012#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 79015#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2))), 79014#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__global_next))), 79016#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:37:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:09,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:09,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:09,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:09,001 INFO L87 Difference]: Start difference. First operand 840 states and 3652 transitions. Second operand 7 states. [2018-07-23 13:37:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:10,099 INFO L93 Difference]: Finished difference Result 1202 states and 5037 transitions. [2018-07-23 13:37:10,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:10,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:10,104 INFO L225 Difference]: With dead ends: 1202 [2018-07-23 13:37:10,104 INFO L226 Difference]: Without dead ends: 1196 [2018-07-23 13:37:10,105 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-07-23 13:37:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 835. [2018-07-23 13:37:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-07-23 13:37:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 3630 transitions. [2018-07-23 13:37:10,643 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 3630 transitions. Word has length 6 [2018-07-23 13:37:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:10,643 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 3630 transitions. [2018-07-23 13:37:10,643 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 3630 transitions. [2018-07-23 13:37:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:10,644 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:10,644 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:10,645 INFO L414 AbstractCegarLoop]: === Iteration 34 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash 914023622, now seen corresponding path program 1 times [2018-07-23 13:37:10,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,669 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:10,670 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:10,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,670 INFO L185 omatonBuilderFactory]: Interpolants [83111#true, 83113#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 83112#false, 83115#(and (or (= product__local__threadpooling_working_1 product__local__threadpooling_end_2) (and (= product__local__threadpooling_end_2 product__local__threadpooling_i_0) (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)))) (or (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_1 product__local__threadpooling_end_2)))), 83114#(and (or (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_1 product__local__threadpooling_end_2))) (or (and (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)) (= product__local__threadpooling_end_2 product__global_next)) (= product__local__threadpooling_working_1 product__local__threadpooling_end_2))), 83117#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 83116#(and (or (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_1 product__local__threadpooling_end_2))) (or (= product__local__threadpooling_working_1 product__local__threadpooling_end_2) (and (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_working_0))))] [2018-07-23 13:37:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:10,671 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:10,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:10,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:10,671 INFO L87 Difference]: Start difference. First operand 835 states and 3630 transitions. Second operand 7 states. [2018-07-23 13:37:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:11,833 INFO L93 Difference]: Finished difference Result 1302 states and 5458 transitions. [2018-07-23 13:37:11,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:11,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:11,837 INFO L225 Difference]: With dead ends: 1302 [2018-07-23 13:37:11,837 INFO L226 Difference]: Without dead ends: 1300 [2018-07-23 13:37:11,838 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2018-07-23 13:37:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 861. [2018-07-23 13:37:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-07-23 13:37:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 3767 transitions. [2018-07-23 13:37:12,250 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 3767 transitions. Word has length 6 [2018-07-23 13:37:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:12,251 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 3767 transitions. [2018-07-23 13:37:12,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 3767 transitions. [2018-07-23 13:37:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:12,251 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:12,252 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:12,252 INFO L414 AbstractCegarLoop]: === Iteration 35 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash 914023495, now seen corresponding path program 1 times [2018-07-23 13:37:12,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:12,274 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:12,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:12,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:12,275 INFO L185 omatonBuilderFactory]: Interpolants [87461#false, 87460#true, 87463#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)) (= product__local__threadpooling_end_2 product__global_next)), 87462#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 87465#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_working_0)), 87464#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_i_0) (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2))), 87466#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:37:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:12,275 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:12,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:12,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:12,276 INFO L87 Difference]: Start difference. First operand 861 states and 3767 transitions. Second operand 7 states. [2018-07-23 13:37:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:13,343 INFO L93 Difference]: Finished difference Result 1320 states and 5542 transitions. [2018-07-23 13:37:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:13,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:13,347 INFO L225 Difference]: With dead ends: 1320 [2018-07-23 13:37:13,347 INFO L226 Difference]: Without dead ends: 1314 [2018-07-23 13:37:13,348 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-07-23 13:37:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 855. [2018-07-23 13:37:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-07-23 13:37:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 3738 transitions. [2018-07-23 13:37:13,864 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 3738 transitions. Word has length 6 [2018-07-23 13:37:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:13,864 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 3738 transitions. [2018-07-23 13:37:13,864 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 3738 transitions. [2018-07-23 13:37:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:13,865 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:13,866 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:13,866 INFO L414 AbstractCegarLoop]: === Iteration 36 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash 914026877, now seen corresponding path program 1 times [2018-07-23 13:37:13,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,884 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:13,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:13,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,885 INFO L185 omatonBuilderFactory]: Interpolants [91841#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 91840#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 91835#true, 91837#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 91836#false, 91839#(and (or (= product__local__threadpooling_working_1 product__local__threadpooling_end_2) (and (= product__local__threadpooling_end_2 product__local__threadpooling_i_0) (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)))) (or (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_1 product__local__threadpooling_end_2)))), 91838#(and (or (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_1 product__local__threadpooling_end_2))) (or (and (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)) (= product__local__threadpooling_end_2 product__global_next)) (= product__local__threadpooling_working_1 product__local__threadpooling_end_2)))] [2018-07-23 13:37:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:13,885 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:13,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:13,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:13,886 INFO L87 Difference]: Start difference. First operand 855 states and 3738 transitions. Second operand 7 states. [2018-07-23 13:37:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:15,074 INFO L93 Difference]: Finished difference Result 1321 states and 5527 transitions. [2018-07-23 13:37:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:15,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:15,078 INFO L225 Difference]: With dead ends: 1321 [2018-07-23 13:37:15,078 INFO L226 Difference]: Without dead ends: 1315 [2018-07-23 13:37:15,078 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2018-07-23 13:37:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 863. [2018-07-23 13:37:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-07-23 13:37:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 3773 transitions. [2018-07-23 13:37:15,508 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 3773 transitions. Word has length 6 [2018-07-23 13:37:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:15,508 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 3773 transitions. [2018-07-23 13:37:15,508 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 3773 transitions. [2018-07-23 13:37:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:15,509 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:15,510 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:15,510 INFO L414 AbstractCegarLoop]: === Iteration 37 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 914026750, now seen corresponding path program 1 times [2018-07-23 13:37:15,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,523 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:15,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:15,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,524 INFO L185 omatonBuilderFactory]: Interpolants [96233#false, 96232#true, 96235#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2)) (= product__local__threadpooling_end_2 product__global_next)), 96234#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 96237#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2))), 96236#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_i_0) (not (= product__local__threadpooling_i_2 product__local__threadpooling_end_2))), 96238#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:37:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,524 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:15,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:15,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:15,525 INFO L87 Difference]: Start difference. First operand 863 states and 3773 transitions. Second operand 7 states. [2018-07-23 13:37:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:16,461 INFO L93 Difference]: Finished difference Result 1331 states and 5585 transitions. [2018-07-23 13:37:16,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:16,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:16,465 INFO L225 Difference]: With dead ends: 1331 [2018-07-23 13:37:16,465 INFO L226 Difference]: Without dead ends: 1325 [2018-07-23 13:37:16,466 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2018-07-23 13:37:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 849. [2018-07-23 13:37:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-07-23 13:37:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 3706 transitions. [2018-07-23 13:37:16,952 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 3706 transitions. Word has length 6 [2018-07-23 13:37:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:16,953 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 3706 transitions. [2018-07-23 13:37:16,953 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 3706 transitions. [2018-07-23 13:37:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:16,954 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:16,954 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:16,954 INFO L414 AbstractCegarLoop]: === Iteration 38 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash 913935975, now seen corresponding path program 1 times [2018-07-23 13:37:16,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,968 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:16,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:16,968 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,969 INFO L185 omatonBuilderFactory]: Interpolants [100617#true, 100619#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 100618#false, 100621#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_i_1) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2))), 100620#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__global_next) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2))), 100623#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 100622#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:37:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,969 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:16,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:16,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:16,969 INFO L87 Difference]: Start difference. First operand 849 states and 3706 transitions. Second operand 7 states. [2018-07-23 13:37:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:17,873 INFO L93 Difference]: Finished difference Result 1442 states and 5955 transitions. [2018-07-23 13:37:17,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:17,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:17,877 INFO L225 Difference]: With dead ends: 1442 [2018-07-23 13:37:17,878 INFO L226 Difference]: Without dead ends: 1436 [2018-07-23 13:37:17,878 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2018-07-23 13:37:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 905. [2018-07-23 13:37:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-07-23 13:37:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 3981 transitions. [2018-07-23 13:37:18,348 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 3981 transitions. Word has length 6 [2018-07-23 13:37:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,349 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 3981 transitions. [2018-07-23 13:37:18,349 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 3981 transitions. [2018-07-23 13:37:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:18,350 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,350 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:18,350 INFO L414 AbstractCegarLoop]: === Iteration 39 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:18,350 INFO L82 PathProgramCache]: Analyzing trace with hash 913935978, now seen corresponding path program 1 times [2018-07-23 13:37:18,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,366 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:18,367 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:18,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,367 INFO L185 omatonBuilderFactory]: Interpolants [105337#false, 105336#true, 105339#(and (or (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__global_next)), 105338#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 105341#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))), 105340#(and (or (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_i_1) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2))), 105342#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)))] [2018-07-23 13:37:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,368 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:18,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:18,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:18,368 INFO L87 Difference]: Start difference. First operand 905 states and 3981 transitions. Second operand 7 states. [2018-07-23 13:37:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:19,391 INFO L93 Difference]: Finished difference Result 1440 states and 5977 transitions. [2018-07-23 13:37:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:19,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:19,395 INFO L225 Difference]: With dead ends: 1440 [2018-07-23 13:37:19,395 INFO L226 Difference]: Without dead ends: 1434 [2018-07-23 13:37:19,396 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2018-07-23 13:37:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 889. [2018-07-23 13:37:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-07-23 13:37:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3911 transitions. [2018-07-23 13:37:19,932 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3911 transitions. Word has length 6 [2018-07-23 13:37:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:19,933 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 3911 transitions. [2018-07-23 13:37:19,933 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3911 transitions. [2018-07-23 13:37:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:19,934 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:19,934 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:19,934 INFO L414 AbstractCegarLoop]: === Iteration 40 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:19,934 INFO L82 PathProgramCache]: Analyzing trace with hash 913940656, now seen corresponding path program 1 times [2018-07-23 13:37:19,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,954 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:19,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:19,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,955 INFO L185 omatonBuilderFactory]: Interpolants [110023#true, 110025#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 110024#false, 110027#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_i_1) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2))), 110026#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__global_next) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2))), 110029#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 110028#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_working_1))] [2018-07-23 13:37:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,955 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:19,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:19,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:19,956 INFO L87 Difference]: Start difference. First operand 889 states and 3911 transitions. Second operand 7 states. [2018-07-23 13:37:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:20,946 INFO L93 Difference]: Finished difference Result 1361 states and 5672 transitions. [2018-07-23 13:37:20,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:20,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:20,949 INFO L225 Difference]: With dead ends: 1361 [2018-07-23 13:37:20,950 INFO L226 Difference]: Without dead ends: 1355 [2018-07-23 13:37:20,950 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2018-07-23 13:37:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 900. [2018-07-23 13:37:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-07-23 13:37:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 3963 transitions. [2018-07-23 13:37:21,461 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 3963 transitions. Word has length 6 [2018-07-23 13:37:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:21,461 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 3963 transitions. [2018-07-23 13:37:21,461 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 3963 transitions. [2018-07-23 13:37:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:37:21,462 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:21,462 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:37:21,462 INFO L414 AbstractCegarLoop]: === Iteration 41 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash 913940659, now seen corresponding path program 1 times [2018-07-23 13:37:21,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,481 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:21,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:21,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,481 INFO L185 omatonBuilderFactory]: Interpolants [114576#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1))), 114571#false, 114570#true, 114573#(and (or (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__global_next)), 114572#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 114575#(and (or (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_working_1)), 114574#(and (or (not (= product__local__threadpooling_working_0 product__local__threadpooling_end_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__local__threadpooling_i_1) (not (= product__local__threadpooling_end_2 product__local__threadpooling_i_2)))] [2018-07-23 13:37:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,482 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:21,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:21,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:21,482 INFO L87 Difference]: Start difference. First operand 900 states and 3963 transitions. Second operand 7 states. [2018-07-23 13:37:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:22,656 INFO L93 Difference]: Finished difference Result 1349 states and 5655 transitions. [2018-07-23 13:37:22,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:22,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-23 13:37:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:22,659 INFO L225 Difference]: With dead ends: 1349 [2018-07-23 13:37:22,660 INFO L226 Difference]: Without dead ends: 1343 [2018-07-23 13:37:22,660 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-07-23 13:37:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 896. [2018-07-23 13:37:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-07-23 13:37:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 3945 transitions. [2018-07-23 13:37:23,194 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 3945 transitions. Word has length 6 [2018-07-23 13:37:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:23,194 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 3945 transitions. [2018-07-23 13:37:23,195 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 3945 transitions. [2018-07-23 13:37:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:23,196 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:23,196 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:23,196 INFO L414 AbstractCegarLoop]: === Iteration 42 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1202922012, now seen corresponding path program 1 times [2018-07-23 13:37:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,207 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:23,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:23,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,208 INFO L185 omatonBuilderFactory]: Interpolants [119089#(and (<= (+ product__local__threadpooling_working_0 4) product__local__threadpooling_working_2) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_2)), 119088#(and (<= (+ product__local__threadpooling_working_0 4) product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_2)), 119090#(and (<= (+ product__local__threadpooling_working_0 4) product__local__threadpooling_working_2) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 119083#true, 119085#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 119084#false, 119087#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_0 4) product__global_next)), 119086#(and (<= (+ product__local__threadpooling_working_0 3) product__local__threadpooling_end_1) (= product__global_next product__local__threadpooling_end_1))] [2018-07-23 13:37:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,208 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:23,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:23,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:23,209 INFO L87 Difference]: Start difference. First operand 896 states and 3945 transitions. Second operand 8 states. [2018-07-23 13:37:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:24,354 INFO L93 Difference]: Finished difference Result 1234 states and 5206 transitions. [2018-07-23 13:37:24,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:24,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:24,357 INFO L225 Difference]: With dead ends: 1234 [2018-07-23 13:37:24,358 INFO L226 Difference]: Without dead ends: 1228 [2018-07-23 13:37:24,358 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-07-23 13:37:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 912. [2018-07-23 13:37:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-07-23 13:37:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 4031 transitions. [2018-07-23 13:37:24,892 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 4031 transitions. Word has length 7 [2018-07-23 13:37:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:24,892 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 4031 transitions. [2018-07-23 13:37:24,892 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 4031 transitions. [2018-07-23 13:37:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:24,893 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:24,893 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:24,893 INFO L414 AbstractCegarLoop]: === Iteration 43 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1202922387, now seen corresponding path program 1 times [2018-07-23 13:37:24,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,903 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:24,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:24,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,904 INFO L185 omatonBuilderFactory]: Interpolants [123395#true, 123397#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 123396#false, 123399#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)), 123398#(and (= product__global_next product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)), 123401#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_2)), 123400#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_2)), 123402#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))] [2018-07-23 13:37:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:24,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:24,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:24,905 INFO L87 Difference]: Start difference. First operand 912 states and 4031 transitions. Second operand 8 states. [2018-07-23 13:37:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:25,876 INFO L93 Difference]: Finished difference Result 1218 states and 5153 transitions. [2018-07-23 13:37:25,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:25,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:25,880 INFO L225 Difference]: With dead ends: 1218 [2018-07-23 13:37:25,880 INFO L226 Difference]: Without dead ends: 1212 [2018-07-23 13:37:25,880 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2018-07-23 13:37:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 967. [2018-07-23 13:37:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2018-07-23 13:37:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 4282 transitions. [2018-07-23 13:37:26,457 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 4282 transitions. Word has length 7 [2018-07-23 13:37:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:26,457 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 4282 transitions. [2018-07-23 13:37:26,457 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 4282 transitions. [2018-07-23 13:37:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:26,458 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:26,458 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:26,459 INFO L414 AbstractCegarLoop]: === Iteration 44 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1202913673, now seen corresponding path program 1 times [2018-07-23 13:37:26,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,470 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:26,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:26,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,471 INFO L185 omatonBuilderFactory]: Interpolants [127793#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_0 4) product__global_next)), 127792#(and (<= (+ product__local__threadpooling_working_0 3) product__local__threadpooling_end_1) (= product__global_next product__local__threadpooling_end_1)), 127795#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_working_0 4) product__local__threadpooling_i_2)), 127794#(and (<= (+ product__local__threadpooling_working_0 4) product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_2)), 127796#(and (<= (+ product__local__threadpooling_working_0 4) product__local__threadpooling_working_2) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 127789#true, 127791#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 127790#false] [2018-07-23 13:37:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,471 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:26,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:26,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:26,472 INFO L87 Difference]: Start difference. First operand 967 states and 4282 transitions. Second operand 8 states. [2018-07-23 13:37:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:27,731 INFO L93 Difference]: Finished difference Result 1390 states and 5887 transitions. [2018-07-23 13:37:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:27,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:27,735 INFO L225 Difference]: With dead ends: 1390 [2018-07-23 13:37:27,735 INFO L226 Difference]: Without dead ends: 1384 [2018-07-23 13:37:27,735 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-07-23 13:37:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1003. [2018-07-23 13:37:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2018-07-23 13:37:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 4463 transitions. [2018-07-23 13:37:28,339 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 4463 transitions. Word has length 7 [2018-07-23 13:37:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:28,339 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 4463 transitions. [2018-07-23 13:37:28,339 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 4463 transitions. [2018-07-23 13:37:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:28,340 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:28,341 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:28,341 INFO L414 AbstractCegarLoop]: === Iteration 45 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1202914048, now seen corresponding path program 1 times [2018-07-23 13:37:28,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,348 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:28,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:28,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,349 INFO L185 omatonBuilderFactory]: Interpolants [132610#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)), 132608#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_2)), 132609#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)), 132603#true, 132606#(and (= product__global_next product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)), 132607#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)), 132604#false, 132605#(<= (+ product__local__threadpooling_working_0 2) product__global_next)] [2018-07-23 13:37:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,349 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:28,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:28,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:28,350 INFO L87 Difference]: Start difference. First operand 1003 states and 4463 transitions. Second operand 8 states. [2018-07-23 13:37:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:29,561 INFO L93 Difference]: Finished difference Result 1366 states and 5794 transitions. [2018-07-23 13:37:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:29,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:29,564 INFO L225 Difference]: With dead ends: 1366 [2018-07-23 13:37:29,565 INFO L226 Difference]: Without dead ends: 1360 [2018-07-23 13:37:29,565 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2018-07-23 13:37:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 999. [2018-07-23 13:37:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2018-07-23 13:37:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 4445 transitions. [2018-07-23 13:37:30,199 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 4445 transitions. Word has length 7 [2018-07-23 13:37:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,199 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 4445 transitions. [2018-07-23 13:37:30,200 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 4445 transitions. [2018-07-23 13:37:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:30,200 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,200 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:30,201 INFO L414 AbstractCegarLoop]: === Iteration 46 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:30,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1214607121, now seen corresponding path program 1 times [2018-07-23 13:37:30,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,211 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:30,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:30,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,212 INFO L185 omatonBuilderFactory]: Interpolants [137366#false, 137367#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 137365#true, 137370#(and (<= (+ product__local__threadpooling_working_0 4) product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__global_next)), 137371#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2))), 137368#(and (<= (+ product__local__threadpooling_working_0 3) product__local__threadpooling_end_1) (= product__global_next product__local__threadpooling_end_1)), 137369#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_0 4) product__global_next)), 137372#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:37:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,212 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:30,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:30,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:30,212 INFO L87 Difference]: Start difference. First operand 999 states and 4445 transitions. Second operand 8 states. [2018-07-23 13:37:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,686 INFO L93 Difference]: Finished difference Result 1768 states and 7537 transitions. [2018-07-23 13:37:31,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:31,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,691 INFO L225 Difference]: With dead ends: 1768 [2018-07-23 13:37:31,691 INFO L226 Difference]: Without dead ends: 1762 [2018-07-23 13:37:31,692 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2018-07-23 13:37:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1256. [2018-07-23 13:37:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-07-23 13:37:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 5599 transitions. [2018-07-23 13:37:32,602 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 5599 transitions. Word has length 7 [2018-07-23 13:37:32,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,602 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 5599 transitions. [2018-07-23 13:37:32,602 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 5599 transitions. [2018-07-23 13:37:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:32,603 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,603 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:32,604 INFO L414 AbstractCegarLoop]: === Iteration 47 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:32,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1214607496, now seen corresponding path program 1 times [2018-07-23 13:37:32,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,613 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:32,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:32,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,614 INFO L185 omatonBuilderFactory]: Interpolants [143443#true, 143446#(and (= product__global_next product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)), 143447#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)), 143444#false, 143445#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 143450#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)), 143448#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1) (<= (+ product__local__threadpooling_working_1 2) product__global_next)), 143449#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))] [2018-07-23 13:37:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,614 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:32,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:32,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:32,614 INFO L87 Difference]: Start difference. First operand 1256 states and 5599 transitions. Second operand 8 states. [2018-07-23 13:37:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:33,959 INFO L93 Difference]: Finished difference Result 1496 states and 6401 transitions. [2018-07-23 13:37:33,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:33,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:33,963 INFO L225 Difference]: With dead ends: 1496 [2018-07-23 13:37:33,963 INFO L226 Difference]: Without dead ends: 1490 [2018-07-23 13:37:33,964 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2018-07-23 13:37:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1223. [2018-07-23 13:37:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-07-23 13:37:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 5442 transitions. [2018-07-23 13:37:34,804 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 5442 transitions. Word has length 7 [2018-07-23 13:37:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:34,804 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 5442 transitions. [2018-07-23 13:37:34,804 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 5442 transitions. [2018-07-23 13:37:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:34,805 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:34,805 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:34,806 INFO L414 AbstractCegarLoop]: === Iteration 48 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:34,806 INFO L82 PathProgramCache]: Analyzing trace with hash 793237902, now seen corresponding path program 1 times [2018-07-23 13:37:34,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,817 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:34,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:34,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,818 INFO L185 omatonBuilderFactory]: Interpolants [148914#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_0) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1)), 148912#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1) (<= (+ product__local__threadpooling_working_1 2) product__global_next)), 148913#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_0) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1)), 148907#true, 148910#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__global_next product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 148911#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_i_1 2) product__global_next)), 148908#false, 148909#(<= (+ product__local__threadpooling_working_2 2) product__global_next)] [2018-07-23 13:37:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,818 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:34,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:34,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:34,819 INFO L87 Difference]: Start difference. First operand 1223 states and 5442 transitions. Second operand 8 states. [2018-07-23 13:37:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:36,447 INFO L93 Difference]: Finished difference Result 2213 states and 9644 transitions. [2018-07-23 13:37:36,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:36,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:36,451 INFO L225 Difference]: With dead ends: 2213 [2018-07-23 13:37:36,451 INFO L226 Difference]: Without dead ends: 1796 [2018-07-23 13:37:36,452 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2018-07-23 13:37:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1481. [2018-07-23 13:37:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-07-23 13:37:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 6626 transitions. [2018-07-23 13:37:37,622 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 6626 transitions. Word has length 7 [2018-07-23 13:37:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:37,623 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 6626 transitions. [2018-07-23 13:37:37,623 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 6626 transitions. [2018-07-23 13:37:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:37,624 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:37,624 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:37,624 INFO L414 AbstractCegarLoop]: === Iteration 49 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash 792036652, now seen corresponding path program 1 times [2018-07-23 13:37:37,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,634 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:37,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:37,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,635 INFO L185 omatonBuilderFactory]: Interpolants [156322#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__global_next product__local__threadpooling_end_1)), 156323#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1)), 156320#false, 156321#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 156326#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1)), 156324#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_0)), 156325#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1)), 156319#true] [2018-07-23 13:37:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,635 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:37,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:37,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:37,636 INFO L87 Difference]: Start difference. First operand 1481 states and 6626 transitions. Second operand 8 states. [2018-07-23 13:37:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:39,564 INFO L93 Difference]: Finished difference Result 2153 states and 9326 transitions. [2018-07-23 13:37:39,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:39,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:39,570 INFO L225 Difference]: With dead ends: 2153 [2018-07-23 13:37:39,570 INFO L226 Difference]: Without dead ends: 2147 [2018-07-23 13:37:39,571 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:37:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2018-07-23 13:37:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1488. [2018-07-23 13:37:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2018-07-23 13:37:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 6663 transitions. [2018-07-23 13:37:40,779 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 6663 transitions. Word has length 7 [2018-07-23 13:37:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:40,779 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 6663 transitions. [2018-07-23 13:37:40,779 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 6663 transitions. [2018-07-23 13:37:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:40,780 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:40,781 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:40,781 INFO L414 AbstractCegarLoop]: === Iteration 50 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash 792036655, now seen corresponding path program 1 times [2018-07-23 13:37:40,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,791 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:40,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:40,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,792 INFO L185 omatonBuilderFactory]: Interpolants [163634#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_0)), 163635#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 163632#(and (= product__global_next product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_end_1)), 163633#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_2 4) product__global_next)), 163636#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 163630#false, 163631#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 163629#true] [2018-07-23 13:37:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:40,792 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:40,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:40,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:40,792 INFO L87 Difference]: Start difference. First operand 1488 states and 6663 transitions. Second operand 8 states. [2018-07-23 13:37:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:42,709 INFO L93 Difference]: Finished difference Result 2162 states and 9262 transitions. [2018-07-23 13:37:42,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:42,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:42,715 INFO L225 Difference]: With dead ends: 2162 [2018-07-23 13:37:42,715 INFO L226 Difference]: Without dead ends: 2156 [2018-07-23 13:37:42,716 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2018-07-23 13:37:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1443. [2018-07-23 13:37:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2018-07-23 13:37:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 6444 transitions. [2018-07-23 13:37:43,759 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 6444 transitions. Word has length 7 [2018-07-23 13:37:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:43,759 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 6444 transitions. [2018-07-23 13:37:43,759 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 6444 transitions. [2018-07-23 13:37:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:43,760 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:43,760 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:43,761 INFO L414 AbstractCegarLoop]: === Iteration 51 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash 792053144, now seen corresponding path program 1 times [2018-07-23 13:37:43,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,772 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:43,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:43,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,773 INFO L185 omatonBuilderFactory]: Interpolants [170870#false, 170871#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 170869#true, 170874#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_0)), 170875#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0)), 170872#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__global_next product__local__threadpooling_end_1)), 170873#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1)), 170876#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1))] [2018-07-23 13:37:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,774 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:43,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:43,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:43,774 INFO L87 Difference]: Start difference. First operand 1443 states and 6444 transitions. Second operand 8 states. [2018-07-23 13:37:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:45,579 INFO L93 Difference]: Finished difference Result 1843 states and 7952 transitions. [2018-07-23 13:37:45,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:45,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:45,584 INFO L225 Difference]: With dead ends: 1843 [2018-07-23 13:37:45,584 INFO L226 Difference]: Without dead ends: 1837 [2018-07-23 13:37:45,585 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2018-07-23 13:37:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1429. [2018-07-23 13:37:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2018-07-23 13:37:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 6363 transitions. [2018-07-23 13:37:46,643 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 6363 transitions. Word has length 7 [2018-07-23 13:37:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:46,643 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 6363 transitions. [2018-07-23 13:37:46,643 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 6363 transitions. [2018-07-23 13:37:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:46,645 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:46,645 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:46,645 INFO L414 AbstractCegarLoop]: === Iteration 52 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:46,646 INFO L82 PathProgramCache]: Analyzing trace with hash 792053147, now seen corresponding path program 1 times [2018-07-23 13:37:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,655 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:46,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:46,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,656 INFO L185 omatonBuilderFactory]: Interpolants [177442#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_0)), 177443#(and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 177440#(and (= product__global_next product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_end_1)), 177441#(and (<= (+ product__local__threadpooling_end_1 1) product__global_next) (<= (+ product__local__threadpooling_working_2 4) product__global_next)), 177444#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 177438#false, 177439#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 177437#true] [2018-07-23 13:37:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,656 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:46,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:46,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:46,657 INFO L87 Difference]: Start difference. First operand 1429 states and 6363 transitions. Second operand 8 states. [2018-07-23 13:37:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:48,632 INFO L93 Difference]: Finished difference Result 2019 states and 8655 transitions. [2018-07-23 13:37:48,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:48,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:48,637 INFO L225 Difference]: With dead ends: 2019 [2018-07-23 13:37:48,638 INFO L226 Difference]: Without dead ends: 2017 [2018-07-23 13:37:48,638 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2018-07-23 13:37:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1340. [2018-07-23 13:37:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2018-07-23 13:37:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 5902 transitions. [2018-07-23 13:37:49,704 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 5902 transitions. Word has length 7 [2018-07-23 13:37:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:49,704 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 5902 transitions. [2018-07-23 13:37:49,704 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 5902 transitions. [2018-07-23 13:37:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:49,705 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:49,705 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:49,705 INFO L414 AbstractCegarLoop]: === Iteration 53 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1257828547, now seen corresponding path program 1 times [2018-07-23 13:37:49,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:49,718 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:49,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:49,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:49,719 INFO L185 omatonBuilderFactory]: Interpolants [184179#true, 184182#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 184183#(and (<= (+ product__local__threadpooling_working_1 1) product__global_next) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1)), 184180#false, 184181#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 184186#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1)), 184184#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1) (not (= product__local__threadpooling_working_1 product__global_next))), 184185#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_working_1))] [2018-07-23 13:37:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:49,719 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:49,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:49,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:49,720 INFO L87 Difference]: Start difference. First operand 1340 states and 5902 transitions. Second operand 8 states. [2018-07-23 13:37:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:51,266 INFO L93 Difference]: Finished difference Result 1696 states and 7339 transitions. [2018-07-23 13:37:51,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:51,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:51,270 INFO L225 Difference]: With dead ends: 1696 [2018-07-23 13:37:51,270 INFO L226 Difference]: Without dead ends: 1690 [2018-07-23 13:37:51,271 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-07-23 13:37:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1381. [2018-07-23 13:37:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2018-07-23 13:37:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 6065 transitions. [2018-07-23 13:37:52,371 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 6065 transitions. Word has length 7 [2018-07-23 13:37:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:52,371 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 6065 transitions. [2018-07-23 13:37:52,371 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 6065 transitions. [2018-07-23 13:37:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:52,372 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:52,372 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:52,372 INFO L414 AbstractCegarLoop]: === Iteration 54 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1257828550, now seen corresponding path program 1 times [2018-07-23 13:37:52,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,381 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:52,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:52,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,381 INFO L185 omatonBuilderFactory]: Interpolants [190354#false, 190355#(<= (+ product__local__threadpooling_working_2 2) product__global_next), 190353#true, 190358#(and (not (= product__local__threadpooling_working_1 product__global_next)) (not (= product__local__threadpooling_working_2 product__global_next))), 190359#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 190356#(and (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_2 3) product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_i_1 1) product__local__threadpooling_end_1)), 190357#(and (<= (+ product__local__threadpooling_working_1 1) product__global_next) (<= (+ product__local__threadpooling_working_2 3) product__global_next)), 190360#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)))] [2018-07-23 13:37:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:52,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:52,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:52,382 INFO L87 Difference]: Start difference. First operand 1381 states and 6065 transitions. Second operand 8 states. [2018-07-23 13:37:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:54,247 INFO L93 Difference]: Finished difference Result 1975 states and 8515 transitions. [2018-07-23 13:37:54,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:54,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:54,252 INFO L225 Difference]: With dead ends: 1975 [2018-07-23 13:37:54,253 INFO L226 Difference]: Without dead ends: 1969 [2018-07-23 13:37:54,253 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-07-23 13:37:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1426. [2018-07-23 13:37:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2018-07-23 13:37:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 6294 transitions. [2018-07-23 13:37:55,500 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 6294 transitions. Word has length 7 [2018-07-23 13:37:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:55,501 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 6294 transitions. [2018-07-23 13:37:55,501 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 6294 transitions. [2018-07-23 13:37:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:55,502 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:55,502 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:55,502 INFO L414 AbstractCegarLoop]: === Iteration 55 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1270465246, now seen corresponding path program 1 times [2018-07-23 13:37:55,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,517 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:55,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:55,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,518 INFO L185 omatonBuilderFactory]: Interpolants [197200#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 197195#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 197194#false, 197193#true, 197199#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2))), 197198#(and (<= (+ product__local__threadpooling_working_0 4) product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__global_next)), 197197#(and (<= (+ product__local__threadpooling_working_1 1) product__global_next) (<= (+ product__local__threadpooling_working_0 3) product__global_next)), 197196#(and (<= (+ product__local__threadpooling_working_0 3) product__local__threadpooling_end_1) (= product__local__threadpooling_end_1 product__global_next))] [2018-07-23 13:37:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,518 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:55,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:55,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:55,518 INFO L87 Difference]: Start difference. First operand 1426 states and 6294 transitions. Second operand 8 states. [2018-07-23 13:37:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:57,347 INFO L93 Difference]: Finished difference Result 1872 states and 7908 transitions. [2018-07-23 13:37:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:57,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:57,351 INFO L225 Difference]: With dead ends: 1872 [2018-07-23 13:37:57,352 INFO L226 Difference]: Without dead ends: 1866 [2018-07-23 13:37:57,352 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2018-07-23 13:37:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1149. [2018-07-23 13:37:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2018-07-23 13:37:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 5015 transitions. [2018-07-23 13:37:58,353 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 5015 transitions. Word has length 7 [2018-07-23 13:37:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:58,353 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 5015 transitions. [2018-07-23 13:37:58,353 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 5015 transitions. [2018-07-23 13:37:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:37:58,355 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:58,355 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:58,355 INFO L414 AbstractCegarLoop]: === Iteration 56 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:58,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1270465621, now seen corresponding path program 1 times [2018-07-23 13:37:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:58,367 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:58,367 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:58,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:58,368 INFO L185 omatonBuilderFactory]: Interpolants [203267#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 203266#false, 203265#true, 203271#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)), 203270#(and (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1) (<= (+ product__local__threadpooling_working_1 2) product__global_next)), 203269#(and (<= (+ product__local__threadpooling_working_1 1) product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)), 203268#(and (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)), 203272#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))] [2018-07-23 13:37:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:58,368 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:58,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:58,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:58,368 INFO L87 Difference]: Start difference. First operand 1149 states and 5015 transitions. Second operand 8 states. [2018-07-23 13:37:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:59,955 INFO L93 Difference]: Finished difference Result 1574 states and 6645 transitions. [2018-07-23 13:37:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:59,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:37:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:59,959 INFO L225 Difference]: With dead ends: 1574 [2018-07-23 13:37:59,959 INFO L226 Difference]: Without dead ends: 1568 [2018-07-23 13:37:59,959 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-07-23 13:38:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1048. [2018-07-23 13:38:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-07-23 13:38:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 4552 transitions. [2018-07-23 13:38:00,903 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 4552 transitions. Word has length 7 [2018-07-23 13:38:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:00,903 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 4552 transitions. [2018-07-23 13:38:00,903 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 4552 transitions. [2018-07-23 13:38:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:00,904 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:00,905 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:00,905 INFO L414 AbstractCegarLoop]: === Iteration 57 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:00,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1717460035, now seen corresponding path program 1 times [2018-07-23 13:38:00,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,916 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:00,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:00,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,917 INFO L185 omatonBuilderFactory]: Interpolants [208535#true, 208539#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (<= (+ product__local__threadpooling_working_2 1) product__global_next)), 208538#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__global_next)), 208537#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 208536#false, 208542#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 208541#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2))), 208540#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__global_next)))] [2018-07-23 13:38:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:00,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:00,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:00,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:00,918 INFO L87 Difference]: Start difference. First operand 1048 states and 4552 transitions. Second operand 8 states. [2018-07-23 13:38:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:02,583 INFO L93 Difference]: Finished difference Result 1637 states and 6901 transitions. [2018-07-23 13:38:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:38:02,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:02,587 INFO L225 Difference]: With dead ends: 1637 [2018-07-23 13:38:02,587 INFO L226 Difference]: Without dead ends: 1631 [2018-07-23 13:38:02,588 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:38:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2018-07-23 13:38:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1078. [2018-07-23 13:38:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2018-07-23 13:38:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 4672 transitions. [2018-07-23 13:38:03,585 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 4672 transitions. Word has length 7 [2018-07-23 13:38:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:03,585 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 4672 transitions. [2018-07-23 13:38:03,585 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 4672 transitions. [2018-07-23 13:38:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:03,586 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:03,586 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:03,586 INFO L414 AbstractCegarLoop]: === Iteration 58 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1717459924, now seen corresponding path program 1 times [2018-07-23 13:38:03,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,597 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:03,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:03,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,598 INFO L185 omatonBuilderFactory]: Interpolants [214000#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 213995#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 213994#false, 213993#true, 213999#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 213998#(and (not (= product__local__threadpooling_working_1 product__global_next)) (not (= product__local__threadpooling_working_2 product__global_next))), 213997#(and (<= (+ product__local__threadpooling_working_1 3) product__global_next) (<= (+ product__local__threadpooling_working_2 1) product__global_next)), 213996#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (= product__local__threadpooling_end_2 product__global_next))] [2018-07-23 13:38:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,598 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:03,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:03,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:03,599 INFO L87 Difference]: Start difference. First operand 1078 states and 4672 transitions. Second operand 8 states. [2018-07-23 13:38:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:05,449 INFO L93 Difference]: Finished difference Result 1711 states and 7234 transitions. [2018-07-23 13:38:05,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:38:05,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:05,454 INFO L225 Difference]: With dead ends: 1711 [2018-07-23 13:38:05,454 INFO L226 Difference]: Without dead ends: 1705 [2018-07-23 13:38:05,454 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:38:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2018-07-23 13:38:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1164. [2018-07-23 13:38:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-07-23 13:38:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 5077 transitions. [2018-07-23 13:38:06,580 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 5077 transitions. Word has length 7 [2018-07-23 13:38:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:06,580 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 5077 transitions. [2018-07-23 13:38:06,580 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 5077 transitions. [2018-07-23 13:38:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:06,581 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:06,582 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:06,582 INFO L414 AbstractCegarLoop]: === Iteration 59 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1702174900, now seen corresponding path program 1 times [2018-07-23 13:38:06,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,591 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:06,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:06,592 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,592 INFO L185 omatonBuilderFactory]: Interpolants [219783#true, 219787#(and (<= (+ product__local__threadpooling_working_2 1) product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 219786#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__local__threadpooling_end_2 product__global_next)), 219785#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 219784#false, 219790#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 219789#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 219788#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__global_next)))] [2018-07-23 13:38:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,592 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:06,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:06,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:06,593 INFO L87 Difference]: Start difference. First operand 1164 states and 5077 transitions. Second operand 8 states. [2018-07-23 13:38:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:08,600 INFO L93 Difference]: Finished difference Result 1830 states and 7707 transitions. [2018-07-23 13:38:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:38:08,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:08,605 INFO L225 Difference]: With dead ends: 1830 [2018-07-23 13:38:08,605 INFO L226 Difference]: Without dead ends: 1824 [2018-07-23 13:38:08,606 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:38:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2018-07-23 13:38:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1202. [2018-07-23 13:38:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2018-07-23 13:38:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 5236 transitions. [2018-07-23 13:38:09,717 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 5236 transitions. Word has length 7 [2018-07-23 13:38:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:09,717 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 5236 transitions. [2018-07-23 13:38:09,717 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 5236 transitions. [2018-07-23 13:38:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:09,718 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:09,718 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:09,719 INFO L414 AbstractCegarLoop]: === Iteration 60 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1702174525, now seen corresponding path program 1 times [2018-07-23 13:38:09,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:09,730 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:09,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:09,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:09,730 INFO L185 omatonBuilderFactory]: Interpolants [225875#true, 225879#(and (<= (+ product__local__threadpooling_working_0 3) product__global_next) (<= (+ product__local__threadpooling_working_2 1) product__global_next)), 225878#(and (= product__local__threadpooling_end_2 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)), 225877#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 225876#false, 225882#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1))), 225881#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))), 225880#(and (not (= product__local__threadpooling_working_2 product__global_next)) (not (= product__local__threadpooling_working_0 product__global_next)))] [2018-07-23 13:38:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:09,731 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:09,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:09,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:09,731 INFO L87 Difference]: Start difference. First operand 1202 states and 5236 transitions. Second operand 8 states. [2018-07-23 13:38:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:11,952 INFO L93 Difference]: Finished difference Result 1937 states and 8213 transitions. [2018-07-23 13:38:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:38:11,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:11,958 INFO L225 Difference]: With dead ends: 1937 [2018-07-23 13:38:11,958 INFO L226 Difference]: Without dead ends: 1931 [2018-07-23 13:38:11,959 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:38:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2018-07-23 13:38:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1246. [2018-07-23 13:38:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1246 states. [2018-07-23 13:38:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 5494 transitions. [2018-07-23 13:38:13,247 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 5494 transitions. Word has length 7 [2018-07-23 13:38:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:13,247 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 5494 transitions. [2018-07-23 13:38:13,247 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 5494 transitions. [2018-07-23 13:38:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:13,248 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:13,248 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:13,248 INFO L414 AbstractCegarLoop]: === Iteration 61 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1730089067, now seen corresponding path program 1 times [2018-07-23 13:38:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:13,258 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:13,258 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:13,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:13,258 INFO L185 omatonBuilderFactory]: Interpolants [232288#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 232283#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 232282#false, 232281#true, 232287#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 232286#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)) (<= (+ product__local__threadpooling_working_2 2) product__global_next)), 232285#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 232284#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__global_next product__local__threadpooling_end_2))] [2018-07-23 13:38:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:13,259 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:13,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:13,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:13,259 INFO L87 Difference]: Start difference. First operand 1246 states and 5494 transitions. Second operand 8 states. [2018-07-23 13:38:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:15,751 INFO L93 Difference]: Finished difference Result 1976 states and 8257 transitions. [2018-07-23 13:38:15,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:38:15,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:15,756 INFO L225 Difference]: With dead ends: 1976 [2018-07-23 13:38:15,757 INFO L226 Difference]: Without dead ends: 1970 [2018-07-23 13:38:15,758 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:38:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-07-23 13:38:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1261. [2018-07-23 13:38:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2018-07-23 13:38:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 5559 transitions. [2018-07-23 13:38:17,032 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 5559 transitions. Word has length 7 [2018-07-23 13:38:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:17,033 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 5559 transitions. [2018-07-23 13:38:17,033 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 5559 transitions. [2018-07-23 13:38:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:17,034 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:17,034 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:17,034 INFO L414 AbstractCegarLoop]: === Iteration 62 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1730088692, now seen corresponding path program 1 times [2018-07-23 13:38:17,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:17,044 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:17,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:17,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:17,044 INFO L185 omatonBuilderFactory]: Interpolants [238800#(and (<= (+ product__local__threadpooling_working_0 4) product__local__threadpooling_working_1) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2))), 238795#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 238794#false, 238793#true, 238799#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_1) (<= (+ product__local__threadpooling_working_0 4) product__local__threadpooling_i_1)), 238798#(and (<= (+ product__local__threadpooling_working_0 4) product__global_next) (<= (+ product__local__threadpooling_working_2 2) product__global_next)), 238797#(and (<= (+ product__local__threadpooling_working_0 product__local__threadpooling_end_2 3) (+ product__global_next product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 238796#(and (= product__global_next product__local__threadpooling_end_2) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2))] [2018-07-23 13:38:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:17,045 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:17,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:17,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:17,045 INFO L87 Difference]: Start difference. First operand 1261 states and 5559 transitions. Second operand 8 states. [2018-07-23 13:38:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:19,503 INFO L93 Difference]: Finished difference Result 1653 states and 7019 transitions. [2018-07-23 13:38:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:38:19,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:19,506 INFO L225 Difference]: With dead ends: 1653 [2018-07-23 13:38:19,506 INFO L226 Difference]: Without dead ends: 1647 [2018-07-23 13:38:19,507 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:38:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2018-07-23 13:38:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1304. [2018-07-23 13:38:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2018-07-23 13:38:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 5730 transitions. [2018-07-23 13:38:20,873 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 5730 transitions. Word has length 7 [2018-07-23 13:38:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:20,873 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 5730 transitions. [2018-07-23 13:38:20,873 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 5730 transitions. [2018-07-23 13:38:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:20,874 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:20,874 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:20,875 INFO L414 AbstractCegarLoop]: === Iteration 63 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:20,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1734682647, now seen corresponding path program 1 times [2018-07-23 13:38:20,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:20,888 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:20,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:20,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:20,889 INFO L185 omatonBuilderFactory]: Interpolants [244738#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 244737#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 244736#(and (or (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__local__threadpooling_i_2 product__local__threadpooling_i_1)) (or (not (= product__local__threadpooling_i_2 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_1))), 244731#true, 244735#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 244734#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__global_next product__local__threadpooling_end_2)), 244733#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 244732#false] [2018-07-23 13:38:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:20,890 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:20,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:20,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:20,890 INFO L87 Difference]: Start difference. First operand 1304 states and 5730 transitions. Second operand 8 states. [2018-07-23 13:38:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:23,881 INFO L93 Difference]: Finished difference Result 2160 states and 9043 transitions. [2018-07-23 13:38:23,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:38:23,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:23,887 INFO L225 Difference]: With dead ends: 2160 [2018-07-23 13:38:23,887 INFO L226 Difference]: Without dead ends: 2158 [2018-07-23 13:38:23,888 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:38:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2018-07-23 13:38:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1316. [2018-07-23 13:38:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2018-07-23 13:38:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 5790 transitions. [2018-07-23 13:38:25,318 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 5790 transitions. Word has length 7 [2018-07-23 13:38:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:25,319 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 5790 transitions. [2018-07-23 13:38:25,319 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 5790 transitions. [2018-07-23 13:38:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:25,319 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:25,320 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:25,320 INFO L414 AbstractCegarLoop]: === Iteration 64 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1734682272, now seen corresponding path program 1 times [2018-07-23 13:38:25,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,338 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:25,338 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:25,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,339 INFO L185 omatonBuilderFactory]: Interpolants [251715#true, 251719#(and (<= (+ product__local__threadpooling_working_0 product__local__threadpooling_end_2 3) (+ product__global_next product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 251718#(and (= product__global_next product__local__threadpooling_end_2) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)), 251717#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 251716#false, 251722#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1))), 251721#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))), 251720#(and (or (<= (+ product__local__threadpooling_working_0 product__local__threadpooling_end_2 3) (+ product__local__threadpooling_i_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (or (not (= product__local__threadpooling_i_2 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_1)))] [2018-07-23 13:38:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,339 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:25,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:25,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:25,340 INFO L87 Difference]: Start difference. First operand 1316 states and 5790 transitions. Second operand 8 states. [2018-07-23 13:38:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:28,525 INFO L93 Difference]: Finished difference Result 2095 states and 8823 transitions. [2018-07-23 13:38:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:28,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:28,531 INFO L225 Difference]: With dead ends: 2095 [2018-07-23 13:38:28,531 INFO L226 Difference]: Without dead ends: 2089 [2018-07-23 13:38:28,532 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:38:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2018-07-23 13:38:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1271. [2018-07-23 13:38:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2018-07-23 13:38:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 5596 transitions. [2018-07-23 13:38:29,925 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 5596 transitions. Word has length 7 [2018-07-23 13:38:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:29,926 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 5596 transitions. [2018-07-23 13:38:29,926 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 5596 transitions. [2018-07-23 13:38:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:29,927 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:29,927 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:29,927 INFO L414 AbstractCegarLoop]: === Iteration 65 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:29,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1734690986, now seen corresponding path program 1 times [2018-07-23 13:38:29,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:29,943 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:29,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:29,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:29,944 INFO L185 omatonBuilderFactory]: Interpolants [258483#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 258482#false, 258481#true, 258487#(or (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_i_2 product__local__threadpooling_working_1))) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_2)), 258486#(and (or (= product__local__threadpooling_i_1 product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2))) (or (not (= product__local__threadpooling_i_1 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_1))), 258485#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 258484#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (= product__global_next product__local__threadpooling_end_2)), 258488#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:38:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:29,944 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:29,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:29,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:29,944 INFO L87 Difference]: Start difference. First operand 1271 states and 5596 transitions. Second operand 8 states. [2018-07-23 13:38:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:33,039 INFO L93 Difference]: Finished difference Result 2123 states and 8958 transitions. [2018-07-23 13:38:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:38:33,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:33,044 INFO L225 Difference]: With dead ends: 2123 [2018-07-23 13:38:33,044 INFO L226 Difference]: Without dead ends: 2117 [2018-07-23 13:38:33,045 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:38:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2018-07-23 13:38:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1269. [2018-07-23 13:38:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2018-07-23 13:38:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 5581 transitions. [2018-07-23 13:38:34,458 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 5581 transitions. Word has length 7 [2018-07-23 13:38:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:34,458 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 5581 transitions. [2018-07-23 13:38:34,458 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 5581 transitions. [2018-07-23 13:38:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:34,460 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:34,460 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:34,460 INFO L414 AbstractCegarLoop]: === Iteration 66 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1734690611, now seen corresponding path program 1 times [2018-07-23 13:38:34,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,476 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:34,476 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:34,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,477 INFO L185 omatonBuilderFactory]: Interpolants [265300#(and (or (<= (+ product__local__threadpooling_working_0 product__local__threadpooling_end_2 3) (+ product__local__threadpooling_i_1 product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (or (not (= product__local__threadpooling_i_2 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_1))), 265301#(or (and (or (not (= product__local__threadpooling_i_2 product__local__threadpooling_working_1)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (<= (+ product__local__threadpooling_end_2 3) product__local__threadpooling_i_2)), 265302#(and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_1))), 265296#false, 265297#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 265298#(and (= product__global_next product__local__threadpooling_end_2) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_2)), 265299#(and (<= (+ product__local__threadpooling_working_0 product__local__threadpooling_end_2 3) (+ product__global_next product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 265295#true] [2018-07-23 13:38:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,477 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:34,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:34,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:34,477 INFO L87 Difference]: Start difference. First operand 1269 states and 5581 transitions. Second operand 8 states. [2018-07-23 13:38:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:37,741 INFO L93 Difference]: Finished difference Result 2108 states and 8913 transitions. [2018-07-23 13:38:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:38:37,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:37,746 INFO L225 Difference]: With dead ends: 2108 [2018-07-23 13:38:37,746 INFO L226 Difference]: Without dead ends: 2106 [2018-07-23 13:38:37,747 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:38:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2018-07-23 13:38:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1224. [2018-07-23 13:38:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2018-07-23 13:38:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 5364 transitions. [2018-07-23 13:38:39,178 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 5364 transitions. Word has length 7 [2018-07-23 13:38:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:39,178 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 5364 transitions. [2018-07-23 13:38:39,178 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 5364 transitions. [2018-07-23 13:38:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:39,179 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:39,179 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:39,179 INFO L414 AbstractCegarLoop]: === Iteration 67 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:39,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1732772609, now seen corresponding path program 1 times [2018-07-23 13:38:39,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:39,188 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:39,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:39,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:39,189 INFO L185 omatonBuilderFactory]: Interpolants [271988#false, 271989#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 271990#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (= product__global_next product__local__threadpooling_end_2)), 271991#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 271987#true, 271992#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (<= (+ product__local__threadpooling_working_2 2) product__global_next)), 271993#(and (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_0) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2))), 271994#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2)))] [2018-07-23 13:38:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:39,189 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:39,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:39,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:39,189 INFO L87 Difference]: Start difference. First operand 1224 states and 5364 transitions. Second operand 8 states. [2018-07-23 13:38:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:41,699 INFO L93 Difference]: Finished difference Result 1823 states and 7639 transitions. [2018-07-23 13:38:41,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:38:41,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:41,704 INFO L225 Difference]: With dead ends: 1823 [2018-07-23 13:38:41,704 INFO L226 Difference]: Without dead ends: 1817 [2018-07-23 13:38:41,704 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:38:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-07-23 13:38:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1235. [2018-07-23 13:38:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-07-23 13:38:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 5415 transitions. [2018-07-23 13:38:43,179 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 5415 transitions. Word has length 7 [2018-07-23 13:38:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:43,179 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 5415 transitions. [2018-07-23 13:38:43,179 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 5415 transitions. [2018-07-23 13:38:43,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:43,180 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:43,180 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:43,180 INFO L414 AbstractCegarLoop]: === Iteration 68 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:43,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1732772498, now seen corresponding path program 1 times [2018-07-23 13:38:43,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:43,190 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:43,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:43,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:43,191 INFO L185 omatonBuilderFactory]: Interpolants [278148#(and (<= (+ product__local__threadpooling_working_1 4) product__local__threadpooling_working_0) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 278144#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (= product__global_next product__local__threadpooling_end_2)), 278145#(and (<= (+ product__local__threadpooling_end_2 product__local__threadpooling_working_1 3) (+ product__global_next product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 278146#(and (<= (+ product__local__threadpooling_working_1 4) product__global_next) (<= (+ product__local__threadpooling_working_2 2) product__global_next)), 278147#(and (<= (+ product__local__threadpooling_working_1 4) product__local__threadpooling_i_0) (<= (+ product__local__threadpooling_working_2 2) product__local__threadpooling_i_0)), 278141#true, 278142#false, 278143#(<= (+ product__local__threadpooling_working_1 2) product__global_next)] [2018-07-23 13:38:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:43,192 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:43,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:43,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:43,192 INFO L87 Difference]: Start difference. First operand 1235 states and 5415 transitions. Second operand 8 states. [2018-07-23 13:38:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:45,177 INFO L93 Difference]: Finished difference Result 1502 states and 6388 transitions. [2018-07-23 13:38:45,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:38:45,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:45,181 INFO L225 Difference]: With dead ends: 1502 [2018-07-23 13:38:45,181 INFO L226 Difference]: Without dead ends: 1496 [2018-07-23 13:38:45,182 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:38:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2018-07-23 13:38:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1178. [2018-07-23 13:38:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2018-07-23 13:38:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 5168 transitions. [2018-07-23 13:38:46,588 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 5168 transitions. Word has length 7 [2018-07-23 13:38:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:46,589 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 5168 transitions. [2018-07-23 13:38:46,589 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 5168 transitions. [2018-07-23 13:38:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:46,590 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:46,590 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:46,590 INFO L414 AbstractCegarLoop]: === Iteration 69 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1733847968, now seen corresponding path program 1 times [2018-07-23 13:38:46,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:46,604 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:46,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:46,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:46,604 INFO L185 omatonBuilderFactory]: Interpolants [283525#true, 283526#false, 283527#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 283532#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 283528#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (= product__global_next product__local__threadpooling_end_2)), 283529#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 283530#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (or (not (= product__local__threadpooling_i_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_0))), 283531#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)))] [2018-07-23 13:38:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:46,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:46,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:46,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:46,605 INFO L87 Difference]: Start difference. First operand 1178 states and 5168 transitions. Second operand 8 states. [2018-07-23 13:38:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:49,263 INFO L93 Difference]: Finished difference Result 1776 states and 7441 transitions. [2018-07-23 13:38:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:38:49,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:49,267 INFO L225 Difference]: With dead ends: 1776 [2018-07-23 13:38:49,268 INFO L226 Difference]: Without dead ends: 1774 [2018-07-23 13:38:49,268 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:38:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2018-07-23 13:38:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1180. [2018-07-23 13:38:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2018-07-23 13:38:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 5177 transitions. [2018-07-23 13:38:50,684 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 5177 transitions. Word has length 7 [2018-07-23 13:38:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:50,684 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 5177 transitions. [2018-07-23 13:38:50,684 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 5177 transitions. [2018-07-23 13:38:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:50,685 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:50,685 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:50,685 INFO L414 AbstractCegarLoop]: === Iteration 70 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1733847857, now seen corresponding path program 1 times [2018-07-23 13:38:50,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:50,700 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:50,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:50,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:50,700 INFO L185 omatonBuilderFactory]: Interpolants [289476#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 289472#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (= product__global_next product__local__threadpooling_end_2)), 289473#(and (<= (+ product__local__threadpooling_end_2 product__local__threadpooling_working_1 3) (+ product__global_next product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 289474#(and (or (not (= product__local__threadpooling_i_0 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_0)) (or (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_end_2 product__local__threadpooling_working_1 3) (+ product__local__threadpooling_i_2 product__local__threadpooling_i_0)))), 289475#(and (not (= product__local__threadpooling_i_0 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 289469#true, 289470#false, 289471#(<= (+ product__local__threadpooling_working_1 2) product__global_next)] [2018-07-23 13:38:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:50,700 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:50,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:50,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:50,701 INFO L87 Difference]: Start difference. First operand 1180 states and 5177 transitions. Second operand 8 states. [2018-07-23 13:38:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:53,340 INFO L93 Difference]: Finished difference Result 1732 states and 7266 transitions. [2018-07-23 13:38:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:53,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:53,344 INFO L225 Difference]: With dead ends: 1732 [2018-07-23 13:38:53,345 INFO L226 Difference]: Without dead ends: 1726 [2018-07-23 13:38:53,345 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:38:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-07-23 13:38:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1131. [2018-07-23 13:38:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2018-07-23 13:38:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 4945 transitions. [2018-07-23 13:38:54,785 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 4945 transitions. Word has length 7 [2018-07-23 13:38:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:54,785 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 4945 transitions. [2018-07-23 13:38:54,785 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 4945 transitions. [2018-07-23 13:38:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:54,786 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:54,786 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:54,786 INFO L414 AbstractCegarLoop]: === Iteration 71 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1733840001, now seen corresponding path program 1 times [2018-07-23 13:38:54,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,804 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:54,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:54,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,805 INFO L185 omatonBuilderFactory]: Interpolants [295236#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_2)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 295232#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (= product__global_next product__local__threadpooling_end_2)), 295233#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 295234#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (or (not (= product__local__threadpooling_i_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_0))), 295235#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_2)) (or (not (= product__local__threadpooling_i_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_2))), 295229#true, 295230#false, 295231#(<= (+ product__local__threadpooling_working_1 2) product__global_next)] [2018-07-23 13:38:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:54,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:54,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:54,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:54,806 INFO L87 Difference]: Start difference. First operand 1131 states and 4945 transitions. Second operand 8 states. [2018-07-23 13:38:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:57,365 INFO L93 Difference]: Finished difference Result 1664 states and 7053 transitions. [2018-07-23 13:38:57,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:38:57,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:38:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:57,369 INFO L225 Difference]: With dead ends: 1664 [2018-07-23 13:38:57,370 INFO L226 Difference]: Without dead ends: 1658 [2018-07-23 13:38:57,370 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:38:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2018-07-23 13:38:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1106. [2018-07-23 13:38:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-07-23 13:38:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 4824 transitions. [2018-07-23 13:38:58,763 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 4824 transitions. Word has length 7 [2018-07-23 13:38:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:58,763 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 4824 transitions. [2018-07-23 13:38:58,763 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 4824 transitions. [2018-07-23 13:38:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:38:58,764 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:58,764 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:58,764 INFO L414 AbstractCegarLoop]: === Iteration 72 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1733839890, now seen corresponding path program 1 times [2018-07-23 13:38:58,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:58,781 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:58,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:38:58,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:58,782 INFO L185 omatonBuilderFactory]: Interpolants [300804#(and (or (not (= product__local__threadpooling_i_0 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_0)) (or (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_end_2 product__local__threadpooling_working_1 3) (+ product__local__threadpooling_i_2 product__local__threadpooling_i_0)))), 300805#(or (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (or (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__local__threadpooling_i_2))) (<= (+ product__local__threadpooling_end_2 3) product__local__threadpooling_i_2)), 300806#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_2))), 300800#false, 300801#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 300802#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (= product__global_next product__local__threadpooling_end_2)), 300803#(and (<= (+ product__local__threadpooling_end_2 product__local__threadpooling_working_1 3) (+ product__global_next product__local__threadpooling_i_2)) (<= (+ product__local__threadpooling_end_2 1) product__global_next)), 300799#true] [2018-07-23 13:38:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:58,782 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:58,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:58,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:58,783 INFO L87 Difference]: Start difference. First operand 1106 states and 4824 transitions. Second operand 8 states. [2018-07-23 13:39:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:01,421 INFO L93 Difference]: Finished difference Result 1634 states and 6909 transitions. [2018-07-23 13:39:01,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:39:01,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-23 13:39:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:01,425 INFO L225 Difference]: With dead ends: 1634 [2018-07-23 13:39:01,425 INFO L226 Difference]: Without dead ends: 1632 [2018-07-23 13:39:01,425 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:39:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2018-07-23 13:39:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1057. [2018-07-23 13:39:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-07-23 13:39:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 4579 transitions. [2018-07-23 13:39:02,813 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 4579 transitions. Word has length 7 [2018-07-23 13:39:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:02,813 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 4579 transitions. [2018-07-23 13:39:02,813 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:39:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 4579 transitions. [2018-07-23 13:39:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:39:02,814 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:02,814 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:02,814 INFO L414 AbstractCegarLoop]: === Iteration 73 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1364097022, now seen corresponding path program 1 times [2018-07-23 13:39:02,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:02,829 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:39:02,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:39:02,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:02,829 INFO L185 omatonBuilderFactory]: Interpolants [306212#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 306213#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 306214#(and (= product__local__threadpooling_i_0 product__local__threadpooling_end_1) (<= product__local__threadpooling_end_0 product__local__threadpooling_working_2)), 306215#(and (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_2)), 306209#true, 306210#false, 306211#(= product__local__threadpooling_end_1 product__global_next), 306216#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2))] [2018-07-23 13:39:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:02,830 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:39:02,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:39:02,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:39:02,830 INFO L87 Difference]: Start difference. First operand 1057 states and 4579 transitions. Second operand 8 states. [2018-07-23 13:39:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:06,580 INFO L93 Difference]: Finished difference Result 2222 states and 9079 transitions. [2018-07-23 13:39:06,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:39:06,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:39:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:06,585 INFO L225 Difference]: With dead ends: 2222 [2018-07-23 13:39:06,585 INFO L226 Difference]: Without dead ends: 2213 [2018-07-23 13:39:06,585 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:39:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2018-07-23 13:39:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1300. [2018-07-23 13:39:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-07-23 13:39:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 5828 transitions. [2018-07-23 13:39:08,351 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 5828 transitions. Word has length 8 [2018-07-23 13:39:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:08,351 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 5828 transitions. [2018-07-23 13:39:08,351 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:39:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 5828 transitions. [2018-07-23 13:39:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:39:08,352 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:08,352 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:08,352 INFO L414 AbstractCegarLoop]: === Iteration 74 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1364097019, now seen corresponding path program 1 times [2018-07-23 13:39:08,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:08,360 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:39:08,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:39:08,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:08,361 INFO L185 omatonBuilderFactory]: Interpolants [313284#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 313280#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 313281#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 313282#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_working_2)), 313283#(and (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_2)), 313277#true, 313278#false, 313279#(= product__local__threadpooling_end_1 product__global_next)] [2018-07-23 13:39:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:08,361 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:39:08,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:39:08,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:39:08,362 INFO L87 Difference]: Start difference. First operand 1300 states and 5828 transitions. Second operand 8 states. [2018-07-23 13:39:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:11,913 INFO L93 Difference]: Finished difference Result 2213 states and 9051 transitions. [2018-07-23 13:39:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:39:11,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:39:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:11,918 INFO L225 Difference]: With dead ends: 2213 [2018-07-23 13:39:11,918 INFO L226 Difference]: Without dead ends: 2195 [2018-07-23 13:39:11,919 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:39:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2018-07-23 13:39:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1364. [2018-07-23 13:39:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2018-07-23 13:39:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 6110 transitions. [2018-07-23 13:39:13,774 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 6110 transitions. Word has length 8 [2018-07-23 13:39:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:13,774 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 6110 transitions. [2018-07-23 13:39:13,774 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:39:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 6110 transitions. [2018-07-23 13:39:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:39:13,775 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:13,775 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:13,775 INFO L414 AbstractCegarLoop]: === Iteration 75 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1364109267, now seen corresponding path program 1 times [2018-07-23 13:39:13,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:13,785 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:39:13,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:39:13,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:13,785 INFO L185 omatonBuilderFactory]: Interpolants [320455#true, 320460#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_working_2)), 320461#(or (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_end_0 1) (+ product__local__threadpooling_working_2 product__local__threadpooling_i_0)))), 320462#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 320456#false, 320457#(= product__local__threadpooling_end_1 product__global_next), 320458#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 320459#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2))] [2018-07-23 13:39:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:13,786 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:39:13,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:39:13,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:39:13,786 INFO L87 Difference]: Start difference. First operand 1364 states and 6110 transitions. Second operand 8 states. [2018-07-23 13:39:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:18,714 INFO L93 Difference]: Finished difference Result 2981 states and 11952 transitions. [2018-07-23 13:39:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:39:18,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:39:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:18,722 INFO L225 Difference]: With dead ends: 2981 [2018-07-23 13:39:18,722 INFO L226 Difference]: Without dead ends: 2972 [2018-07-23 13:39:18,723 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:39:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2018-07-23 13:39:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1377. [2018-07-23 13:39:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-07-23 13:39:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 6173 transitions. [2018-07-23 13:39:20,703 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 6173 transitions. Word has length 8 [2018-07-23 13:39:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:20,704 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 6173 transitions. [2018-07-23 13:39:20,704 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:39:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 6173 transitions. [2018-07-23 13:39:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:39:20,705 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:20,705 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:20,705 INFO L414 AbstractCegarLoop]: === Iteration 76 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1364109264, now seen corresponding path program 1 times [2018-07-23 13:39:20,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:20,712 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:39:20,712 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:39:20,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:20,713 INFO L185 omatonBuilderFactory]: Interpolants [329207#true, 329213#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_end_0 1) (+ product__local__threadpooling_working_2 product__local__threadpooling_i_0))), 329212#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_working_2)), 329214#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 329209#(= product__local__threadpooling_end_1 product__global_next), 329208#false, 329211#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 329210#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next))] [2018-07-23 13:39:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:20,713 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:39:20,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:39:20,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:39:20,713 INFO L87 Difference]: Start difference. First operand 1377 states and 6173 transitions. Second operand 8 states. [2018-07-23 13:39:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:24,794 INFO L93 Difference]: Finished difference Result 2347 states and 9582 transitions. [2018-07-23 13:39:24,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:39:24,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:39:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:24,800 INFO L225 Difference]: With dead ends: 2347 [2018-07-23 13:39:24,800 INFO L226 Difference]: Without dead ends: 2338 [2018-07-23 13:39:24,801 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:39:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2018-07-23 13:39:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1383. [2018-07-23 13:39:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-07-23 13:39:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 6201 transitions. [2018-07-23 13:39:26,814 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 6201 transitions. Word has length 8 [2018-07-23 13:39:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:26,814 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 6201 transitions. [2018-07-23 13:39:26,814 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:39:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 6201 transitions. [2018-07-23 13:39:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:39:26,815 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:26,815 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:26,815 INFO L414 AbstractCegarLoop]: === Iteration 77 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1364109261, now seen corresponding path program 1 times [2018-07-23 13:39:26,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:26,829 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:39:26,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:39:26,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:26,830 INFO L185 omatonBuilderFactory]: Interpolants [336695#true, 336701#(or (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)))), 336700#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (or (not (= product__local__threadpooling_working_2 product__local__threadpooling_end_1)) (<= product__local__threadpooling_end_0 product__local__threadpooling_working_2))), 336702#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 336697#(= product__local__threadpooling_end_1 product__global_next), 336696#false, 336699#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 336698#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next))] [2018-07-23 13:39:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:26,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:39:26,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:39:26,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:39:26,831 INFO L87 Difference]: Start difference. First operand 1383 states and 6201 transitions. Second operand 8 states. [2018-07-23 13:39:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:32,375 INFO L93 Difference]: Finished difference Result 3180 states and 12832 transitions. [2018-07-23 13:39:32,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:39:32,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:39:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:32,383 INFO L225 Difference]: With dead ends: 3180 [2018-07-23 13:39:32,383 INFO L226 Difference]: Without dead ends: 3171 [2018-07-23 13:39:32,384 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:39:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2018-07-23 13:39:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 1448. [2018-07-23 13:39:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-07-23 13:39:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 6499 transitions. [2018-07-23 13:39:34,505 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 6499 transitions. Word has length 8 [2018-07-23 13:39:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:34,505 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 6499 transitions. [2018-07-23 13:39:34,505 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:39:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 6499 transitions. [2018-07-23 13:39:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:39:34,506 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:34,506 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:34,506 INFO L414 AbstractCegarLoop]: === Iteration 78 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1364367776, now seen corresponding path program 1 times [2018-07-23 13:39:34,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:34,516 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:39:34,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:39:34,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:34,517 INFO L185 omatonBuilderFactory]: Interpolants [345989#(or (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_end_0 1) (+ product__local__threadpooling_working_2 product__local__threadpooling_i_0)))), 345988#(and (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_end_0 1) (+ product__local__threadpooling_i_2 product__local__threadpooling_i_0)) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 345990#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 345985#(= product__local__threadpooling_end_1 product__global_next), 345984#false, 345987#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 345986#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 345983#true] [2018-07-23 13:39:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:34,517 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:39:34,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:39:34,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:39:34,518 INFO L87 Difference]: Start difference. First operand 1448 states and 6499 transitions. Second operand 8 states. [2018-07-23 13:39:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:41,209 INFO L93 Difference]: Finished difference Result 3670 states and 14564 transitions. [2018-07-23 13:39:41,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:39:41,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:39:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:41,216 INFO L225 Difference]: With dead ends: 3670 [2018-07-23 13:39:41,217 INFO L226 Difference]: Without dead ends: 3661 [2018-07-23 13:39:41,217 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:39:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3661 states. [2018-07-23 13:39:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3661 to 1510. [2018-07-23 13:39:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2018-07-23 13:39:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 6824 transitions. [2018-07-23 13:39:43,506 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 6824 transitions. Word has length 8 [2018-07-23 13:39:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:43,506 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 6824 transitions. [2018-07-23 13:39:43,506 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:39:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 6824 transitions. [2018-07-23 13:39:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:39:43,507 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:43,507 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:43,507 INFO L414 AbstractCegarLoop]: === Iteration 79 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1364367773, now seen corresponding path program 1 times [2018-07-23 13:39:43,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:43,521 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:39:43,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:39:43,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:43,522 INFO L185 omatonBuilderFactory]: Interpolants [356400#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 356397#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 356396#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 356399#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_end_0 1) (+ product__local__threadpooling_working_2 product__local__threadpooling_i_0))), 356398#(and (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_end_0 1) (+ product__local__threadpooling_i_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 356393#true, 356395#(= product__local__threadpooling_end_1 product__global_next), 356394#false] [2018-07-23 13:39:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:43,522 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:39:43,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:39:43,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:39:43,523 INFO L87 Difference]: Start difference. First operand 1510 states and 6824 transitions. Second operand 8 states. [2018-07-23 13:39:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:48,838 INFO L93 Difference]: Finished difference Result 2858 states and 11589 transitions. [2018-07-23 13:39:48,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:39:48,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:39:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:48,846 INFO L225 Difference]: With dead ends: 2858 [2018-07-23 13:39:48,846 INFO L226 Difference]: Without dead ends: 2849 [2018-07-23 13:39:48,846 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:39:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2018-07-23 13:39:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 1513. [2018-07-23 13:39:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2018-07-23 13:39:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 6838 transitions. [2018-07-23 13:39:51,177 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 6838 transitions. Word has length 8 [2018-07-23 13:39:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:51,177 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 6838 transitions. [2018-07-23 13:39:51,177 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:39:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 6838 transitions. [2018-07-23 13:39:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:39:51,178 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:51,178 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:51,178 INFO L414 AbstractCegarLoop]: === Iteration 80 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1364367770, now seen corresponding path program 1 times [2018-07-23 13:39:51,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:51,186 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:39:51,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:39:51,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:51,186 INFO L185 omatonBuilderFactory]: Interpolants [365173#true, 365175#(= product__local__threadpooling_end_1 product__global_next), 365174#false, 365180#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 365177#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 365176#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 365179#(or (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)))), 365178#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2))] [2018-07-23 13:39:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:51,187 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:39:51,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:39:51,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:39:51,187 INFO L87 Difference]: Start difference. First operand 1513 states and 6838 transitions. Second operand 8 states. [2018-07-23 13:39:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:58,208 INFO L93 Difference]: Finished difference Result 3732 states and 15122 transitions. [2018-07-23 13:39:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:39:58,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:39:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:58,216 INFO L225 Difference]: With dead ends: 3732 [2018-07-23 13:39:58,217 INFO L226 Difference]: Without dead ends: 3723 [2018-07-23 13:39:58,218 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:39:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2018-07-23 13:40:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 1617. [2018-07-23 13:40:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2018-07-23 13:40:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 7349 transitions. [2018-07-23 13:40:00,834 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 7349 transitions. Word has length 8 [2018-07-23 13:40:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:00,834 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 7349 transitions. [2018-07-23 13:40:00,834 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:40:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 7349 transitions. [2018-07-23 13:40:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:40:00,835 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:00,835 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:00,836 INFO L414 AbstractCegarLoop]: === Iteration 81 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:40:00,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1364360832, now seen corresponding path program 1 times [2018-07-23 13:40:00,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:00,845 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:40:00,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:40:00,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:00,846 INFO L185 omatonBuilderFactory]: Interpolants [375920#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 375917#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 375916#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 375919#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_2)), 375918#(and (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_end_0 1) (+ product__local__threadpooling_i_2 product__local__threadpooling_i_0)) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 375913#true, 375915#(= product__local__threadpooling_end_1 product__global_next), 375914#false] [2018-07-23 13:40:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:00,846 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:40:00,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:40:00,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:40:00,847 INFO L87 Difference]: Start difference. First operand 1617 states and 7349 transitions. Second operand 8 states. [2018-07-23 13:40:06,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:06,940 INFO L93 Difference]: Finished difference Result 3049 states and 12401 transitions. [2018-07-23 13:40:06,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:40:06,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:40:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:06,948 INFO L225 Difference]: With dead ends: 3049 [2018-07-23 13:40:06,948 INFO L226 Difference]: Without dead ends: 3040 [2018-07-23 13:40:06,949 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:40:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2018-07-23 13:40:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 1700. [2018-07-23 13:40:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2018-07-23 13:40:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 7749 transitions. [2018-07-23 13:40:09,773 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 7749 transitions. Word has length 8 [2018-07-23 13:40:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:09,774 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 7749 transitions. [2018-07-23 13:40:09,774 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:40:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 7749 transitions. [2018-07-23 13:40:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:40:09,775 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:09,775 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:09,775 INFO L414 AbstractCegarLoop]: === Iteration 82 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:40:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1364360829, now seen corresponding path program 1 times [2018-07-23 13:40:09,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:09,782 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:40:09,782 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:40:09,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:09,783 INFO L185 omatonBuilderFactory]: Interpolants [385460#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 385457#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 385456#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 385459#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))), 385458#(and (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_end_0 1) (+ product__local__threadpooling_i_2 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 385453#true, 385455#(= product__local__threadpooling_end_1 product__global_next), 385454#false] [2018-07-23 13:40:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:09,783 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:40:09,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:40:09,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:40:09,783 INFO L87 Difference]: Start difference. First operand 1700 states and 7749 transitions. Second operand 8 states. [2018-07-23 13:40:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:15,560 INFO L93 Difference]: Finished difference Result 2875 states and 11849 transitions. [2018-07-23 13:40:15,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:40:15,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:40:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:15,567 INFO L225 Difference]: With dead ends: 2875 [2018-07-23 13:40:15,567 INFO L226 Difference]: Without dead ends: 2866 [2018-07-23 13:40:15,567 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:40:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2018-07-23 13:40:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 1712. [2018-07-23 13:40:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2018-07-23 13:40:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 7791 transitions. [2018-07-23 13:40:18,430 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 7791 transitions. Word has length 8 [2018-07-23 13:40:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:18,430 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 7791 transitions. [2018-07-23 13:40:18,430 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:40:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 7791 transitions. [2018-07-23 13:40:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:40:18,431 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:18,431 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:18,431 INFO L414 AbstractCegarLoop]: === Iteration 83 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:40:18,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1364360826, now seen corresponding path program 1 times [2018-07-23 13:40:18,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:18,438 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:40:18,439 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:40:18,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:18,439 INFO L185 omatonBuilderFactory]: Interpolants [394672#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0))), 394670#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 394671#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_2)), 394668#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 394669#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 394666#false, 394667#(= product__local__threadpooling_end_1 product__global_next), 394665#true] [2018-07-23 13:40:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:18,439 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:40:18,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:40:18,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:40:18,440 INFO L87 Difference]: Start difference. First operand 1712 states and 7791 transitions. Second operand 8 states. [2018-07-23 13:40:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:25,250 INFO L93 Difference]: Finished difference Result 3383 states and 13936 transitions. [2018-07-23 13:40:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:40:25,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:40:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:25,258 INFO L225 Difference]: With dead ends: 3383 [2018-07-23 13:40:25,259 INFO L226 Difference]: Without dead ends: 3374 [2018-07-23 13:40:25,259 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:40:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2018-07-23 13:40:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 1737. [2018-07-23 13:40:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-07-23 13:40:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 7901 transitions. [2018-07-23 13:40:28,230 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 7901 transitions. Word has length 8 [2018-07-23 13:40:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:28,230 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 7901 transitions. [2018-07-23 13:40:28,230 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:40:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 7901 transitions. [2018-07-23 13:40:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:40:28,231 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:28,231 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:28,231 INFO L414 AbstractCegarLoop]: === Iteration 84 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:40:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1363850045, now seen corresponding path program 1 times [2018-07-23 13:40:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:28,239 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:40:28,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:40:28,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:28,240 INFO L185 omatonBuilderFactory]: Interpolants [404950#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 404948#(and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_2) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)), 404949#(and (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_2)), 404946#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 404947#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 404944#false, 404945#(= product__local__threadpooling_end_1 product__global_next), 404943#true] [2018-07-23 13:40:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:28,240 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:40:28,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:40:28,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:40:28,240 INFO L87 Difference]: Start difference. First operand 1737 states and 7901 transitions. Second operand 8 states. [2018-07-23 13:40:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:34,249 INFO L93 Difference]: Finished difference Result 2928 states and 12105 transitions. [2018-07-23 13:40:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:40:34,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:40:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:34,256 INFO L225 Difference]: With dead ends: 2928 [2018-07-23 13:40:34,256 INFO L226 Difference]: Without dead ends: 2919 [2018-07-23 13:40:34,257 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:40:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2018-07-23 13:40:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1817. [2018-07-23 13:40:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-07-23 13:40:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 8308 transitions. [2018-07-23 13:40:37,324 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 8308 transitions. Word has length 8 [2018-07-23 13:40:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:37,324 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 8308 transitions. [2018-07-23 13:40:37,324 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:40:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 8308 transitions. [2018-07-23 13:40:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:40:37,325 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:37,325 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:37,325 INFO L414 AbstractCegarLoop]: === Iteration 85 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:40:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1363850042, now seen corresponding path program 1 times [2018-07-23 13:40:37,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:37,333 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:40:37,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:40:37,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:37,333 INFO L185 omatonBuilderFactory]: Interpolants [414470#(and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_2) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)), 414471#(and (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_2)), 414468#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 414469#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 414466#false, 414467#(= product__local__threadpooling_end_1 product__global_next), 414465#true, 414472#(and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2))] [2018-07-23 13:40:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:37,333 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:40:37,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:40:37,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:40:37,334 INFO L87 Difference]: Start difference. First operand 1817 states and 8308 transitions. Second operand 8 states. [2018-07-23 13:40:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:43,347 INFO L93 Difference]: Finished difference Result 2907 states and 12077 transitions. [2018-07-23 13:40:43,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:40:43,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:40:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:43,355 INFO L225 Difference]: With dead ends: 2907 [2018-07-23 13:40:43,355 INFO L226 Difference]: Without dead ends: 2889 [2018-07-23 13:40:43,356 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:40:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2018-07-23 13:40:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1774. [2018-07-23 13:40:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2018-07-23 13:40:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 8124 transitions. [2018-07-23 13:40:46,517 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 8124 transitions. Word has length 8 [2018-07-23 13:40:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:46,517 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 8124 transitions. [2018-07-23 13:40:46,517 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:40:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 8124 transitions. [2018-07-23 13:40:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:40:46,519 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:46,519 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:46,519 INFO L414 AbstractCegarLoop]: === Iteration 86 === [productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr23AssertViolationASSERT, productErr7AssertViolationASSERT, productErr17AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr16AssertViolationASSERT, productErr20AssertViolationASSERT, productErr13AssertViolationASSERT, productErr24AssertViolationASSERT, productErr1AssertViolationASSERT, productErr21AssertViolationASSERT, productErr5AssertViolationASSERT, productErr15AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr19AssertViolationASSERT, productErr25AssertViolationASSERT, productErr22AssertViolationASSERT, productErr14AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr18AssertViolationASSERT, productErr26AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:40:46,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1363849580, now seen corresponding path program 1 times [2018-07-23 13:40:46,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:46,530 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:40:46,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:40:46,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:46,531 INFO L185 omatonBuilderFactory]: Interpolants [423862#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__global_next)), 423863#(and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (<= product__local__threadpooling_end_0 product__local__threadpooling_i_2)), 423860#false, 423861#(= product__local__threadpooling_end_1 product__global_next), 423859#true, 423866#(and (not (= product__local__threadpooling_working_2 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_2)), 423864#(and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_2) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)), 423865#(and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_2) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_2))] [2018-07-23 13:40:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:46,531 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:40:46,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:40:46,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:40:46,532 INFO L87 Difference]: Start difference. First operand 1774 states and 8124 transitions. Second operand 8 states. Received shutdown request... [2018-07-23 13:40:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:40:47,812 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:40:47,819 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:40:47,819 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:40:47 BoogieIcfgContainer [2018-07-23 13:40:47,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:40:47,823 INFO L168 Benchmark]: Toolchain (without parser) took 252906.21 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 120.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-07-23 13:40:47,825 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:40:47,825 INFO L168 Benchmark]: Boogie Preprocessor took 107.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:40:47,825 INFO L168 Benchmark]: RCFGBuilder took 558.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:40:47,826 INFO L168 Benchmark]: TraceAbstraction took 252233.94 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 99.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-07-23 13:40:47,830 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 558.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252233.94 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 99.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (1774states) and interpolant automaton (currently 11 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (668 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 252.1s OverallTime, 86 OverallIterations, 2 TraceHistogramMax, 171.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19359 SDtfs, 37556 SDslu, 29190 SDs, 0 SdLazy, 188764 SolverSat, 16936 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1334 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3213 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1817occurred in iteration=84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 4/4 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 78.4s AutomataMinimizationTime, 85 MinimizatonAttempts, 47244 StatesRemovedByMinimization, 85 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 24793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 86 InterpolantComputations, 86 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-40-47-845.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-40-47-845.csv Completed graceful shutdown