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_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:36:36,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:36:36,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:36:36,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:36:36,534 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:36:36,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:36:36,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:36:36,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:36:36,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:36:36,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:36:36,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:36:36,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:36:36,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:36:36,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:36:36,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:36:36,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:36:36,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:36:36,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:36:36,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:36:36,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:36:36,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:36:36,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:36:36,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:36:36,584 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:36:36,584 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:36:36,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:36:36,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:36:36,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:36:36,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:36:36,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:36:36,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:36:36,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:36:36,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:36:36,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:36:36,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:36:36,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:36:36,593 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:36,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:36:36,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:36:36,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:36:36,625 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:36:36,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:36:36,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:36:36,626 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:36:36,626 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:36:36,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:36:36,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:36:36,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:36:36,710 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:36:36,711 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:36:36,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-07-23 13:36:36,713 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-07-23 13:36:36,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:36:36,797 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:36:36,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:36:36,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:36:36,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:36:36,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/1) ... [2018-07-23 13:36:36,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/1) ... [2018-07-23 13:36:36,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/1) ... [2018-07-23 13:36:36,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/1) ... [2018-07-23 13:36:36,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/1) ... [2018-07-23 13:36:36,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/1) ... [2018-07-23 13:36:36,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/1) ... [2018-07-23 13:36:36,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:36:36,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:36:36,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:36:36,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:36:36,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/1) ... [2018-07-23 13:36:36,977 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-23 13:36:36,977 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-23 13:36:36,978 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-23 13:36:37,255 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:36:37,256 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:37 BoogieIcfgContainer [2018-07-23 13:36:37,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:36:37,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:36:37,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:36:37,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:36:37,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:36" (1/2) ... [2018-07-23 13:36:37,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30048c48 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:36:37, skipping insertion in model container [2018-07-23 13:36:37,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:37" (2/2) ... [2018-07-23 13:36:37,267 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-07-23 13:36:37,279 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:36:37,288 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-07-23 13:36:37,339 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:36:37,340 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:36:37,341 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:36:37,341 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:36:37,341 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:36:37,341 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:36:37,341 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:36:37,341 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:36:37,342 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:36:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-07-23 13:36:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:36:37,371 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:37,372 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:37,373 INFO L414 AbstractCegarLoop]: === Iteration 1 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:37,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-07-23 13:36:37,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:37,498 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,500 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:37,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:36:37,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:37,504 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,504 INFO L185 omatonBuilderFactory]: Interpolants [67#true, 68#false, 69#(< (+ product__local__threadpooling_working_1 1.0) product__global_next), 70#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_begin_0), 71#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 72#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0)] [2018-07-23 13:36:37,505 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,506 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:37,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:37,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:37,525 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-07-23 13:36:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:38,129 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-07-23 13:36:38,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:36:38,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-07-23 13:36:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:38,153 INFO L225 Difference]: With dead ends: 163 [2018-07-23 13:36:38,153 INFO L226 Difference]: Without dead ends: 158 [2018-07-23 13:36:38,157 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-23 13:36:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-07-23 13:36:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 13:36:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-07-23 13:36:38,236 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-07-23 13:36:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:38,236 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-07-23 13:36:38,237 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-07-23 13:36:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:36:38,238 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:38,238 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:38,239 INFO L414 AbstractCegarLoop]: === Iteration 2 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-07-23 13:36:38,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:38,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:36:38,259 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:38,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:36:38,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:38,260 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,261 INFO L185 omatonBuilderFactory]: Interpolants [592#false, 593#(< (+ product__local__threadpooling_working_0 1.0) product__global_next), 594#(< (+ product__local__threadpooling_working_0 1.0) product__local__threadpooling_begin_1), 595#(< (+ product__local__threadpooling_working_0 1.0) product__local__threadpooling_i_1), 596#(< (+ product__local__threadpooling_working_0 1.0) product__local__threadpooling_working_1), 591#true] [2018-07-23 13:36:38,261 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,263 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:38,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:38,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:38,264 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-07-23 13:36:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:38,634 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-07-23 13:36:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:36:38,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-07-23 13:36:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:38,643 INFO L225 Difference]: With dead ends: 188 [2018-07-23 13:36:38,644 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 13:36:38,645 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 13:36:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-07-23 13:36:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-23 13:36:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-07-23 13:36:38,695 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-07-23 13:36:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:38,699 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-07-23 13:36:38,699 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-07-23 13:36:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:36:38,702 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:38,702 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:38,703 INFO L414 AbstractCegarLoop]: === Iteration 3 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-07-23 13:36:38,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:38,732 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,733 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:38,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:38,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:38,736 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,737 INFO L185 omatonBuilderFactory]: Interpolants [1216#false, 1217#(< (+ product__local__threadpooling_working_0 1.0) (+ product__global_next product__global_workload)), 1218#(< (+ product__local__threadpooling_working_0 1.0) product__global_next), 1219#(< (+ product__local__threadpooling_working_0 1.0) product__local__threadpooling_begin_1), 1220#(< (+ product__local__threadpooling_working_0 1.0) product__local__threadpooling_i_1), 1221#(< (+ product__local__threadpooling_working_0 1.0) product__local__threadpooling_working_1), 1215#true] [2018-07-23 13:36:38,738 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,738 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:38,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:38,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:38,741 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-07-23 13:36:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:39,106 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-07-23 13:36:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:39,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-07-23 13:36:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:39,113 INFO L225 Difference]: With dead ends: 283 [2018-07-23 13:36:39,114 INFO L226 Difference]: Without dead ends: 278 [2018-07-23 13:36:39,115 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-23 13:36:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-07-23 13:36:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-23 13:36:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-07-23 13:36:39,159 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-07-23 13:36:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:39,160 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-07-23 13:36:39,160 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:39,163 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-07-23 13:36:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:36:39,165 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:39,165 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:39,165 INFO L414 AbstractCegarLoop]: === Iteration 4 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-07-23 13:36:39,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:39,204 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,205 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:39,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:39,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:39,206 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,206 INFO L185 omatonBuilderFactory]: Interpolants [2096#true, 2097#false, 2098#(< (+ product__local__threadpooling_working_1 1.0) (+ product__global_next product__global_workload)), 2099#(not (= product__local__threadpooling_working_1 product__global_next)), 2100#(not (= product__local__threadpooling_working_1 product__local__threadpooling_begin_0)), 2101#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 2102#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:39,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:36:39,207 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:39,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:39,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:39,209 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-07-23 13:36:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:39,536 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-07-23 13:36:39,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:36:39,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-07-23 13:36:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:39,540 INFO L225 Difference]: With dead ends: 387 [2018-07-23 13:36:39,540 INFO L226 Difference]: Without dead ends: 375 [2018-07-23 13:36:39,542 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-07-23 13:36:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-07-23 13:36:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 13:36:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-07-23 13:36:39,603 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-07-23 13:36:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:39,604 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-07-23 13:36:39,604 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-07-23 13:36:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:39,609 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:39,609 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:39,609 INFO L414 AbstractCegarLoop]: === Iteration 5 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-07-23 13:36:39,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:39,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:36:39,636 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:39,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:39,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:39,637 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,638 INFO L185 omatonBuilderFactory]: Interpolants [3301#true, 3302#false, 3303#(< 0.0 product__global_workload), 3304#(< product__local__threadpooling_begin_0 product__global_next), 3305#(< product__local__threadpooling_i_0 product__global_next), 3306#(< product__local__threadpooling_working_0 product__global_next), 3307#(< product__local__threadpooling_working_0 product__local__threadpooling_begin_1), 3308#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1), 3309#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1)] [2018-07-23 13:36:39,638 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,638 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:39,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:39,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:39,640 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-07-23 13:36:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:40,575 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-07-23 13:36:40,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:36:40,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:40,582 INFO L225 Difference]: With dead ends: 725 [2018-07-23 13:36:40,582 INFO L226 Difference]: Without dead ends: 717 [2018-07-23 13:36:40,584 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:36:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-07-23 13:36:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-07-23 13:36:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-07-23 13:36:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-07-23 13:36:40,713 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-07-23 13:36:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:40,713 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-07-23 13:36:40,713 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-07-23 13:36:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:40,719 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:40,719 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:40,720 INFO L414 AbstractCegarLoop]: === Iteration 6 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-07-23 13:36:40,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:40,755 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,756 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:40,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:40,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:40,760 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,761 INFO L185 omatonBuilderFactory]: Interpolants [5504#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 5496#true, 5497#false, 5498#(< 0.0 product__global_workload), 5499#(< product__local__threadpooling_begin_0 product__global_next), 5500#(< product__local__threadpooling_i_0 product__global_next), 5501#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 5502#(< product__local__threadpooling_working_0 product__local__threadpooling_begin_1), 5503#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1)] [2018-07-23 13:36:40,761 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,761 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:40,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:40,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:40,762 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-07-23 13:36:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:42,044 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-07-23 13:36:42,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:36:42,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:42,054 INFO L225 Difference]: With dead ends: 1008 [2018-07-23 13:36:42,055 INFO L226 Difference]: Without dead ends: 1000 [2018-07-23 13:36:42,057 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:36:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-07-23 13:36:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-07-23 13:36:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-07-23 13:36:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-07-23 13:36:42,184 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-07-23 13:36:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:42,185 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-07-23 13:36:42,185 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-07-23 13:36:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:42,190 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:42,191 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:42,191 INFO L414 AbstractCegarLoop]: === Iteration 7 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-07-23 13:36:42,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:42,221 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,222 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:42,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:42,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:42,223 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,223 INFO L185 omatonBuilderFactory]: Interpolants [8291#true, 8292#false, 8293#(< 0.0 product__global_workload), 8294#(< product__local__threadpooling_begin_0 product__global_next), 8295#(< product__local__threadpooling_i_0 product__global_next), 8296#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 8297#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 8298#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1), 8299#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1)] [2018-07-23 13:36:42,223 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,224 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:42,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:42,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:42,224 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-07-23 13:36:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:43,392 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-07-23 13:36:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:36:43,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:43,402 INFO L225 Difference]: With dead ends: 924 [2018-07-23 13:36:43,402 INFO L226 Difference]: Without dead ends: 916 [2018-07-23 13:36:43,404 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:36:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-07-23 13:36:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-07-23 13:36:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-07-23 13:36:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-07-23 13:36:43,548 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-07-23 13:36:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:43,549 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-07-23 13:36:43,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-07-23 13:36:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:43,550 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:43,550 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:43,551 INFO L414 AbstractCegarLoop]: === Iteration 8 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-07-23 13:36:43,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:43,568 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,568 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:43,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:43,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:43,569 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,569 INFO L185 omatonBuilderFactory]: Interpolants [10976#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 10968#true, 10969#false, 10970#(< 0.0 product__global_workload), 10971#(< product__local__threadpooling_begin_0 product__global_next), 10972#(< product__local__threadpooling_i_0 product__global_next), 10973#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 10974#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 10975#(< product__local__threadpooling_i_0 product__local__threadpooling_working_1)] [2018-07-23 13:36:43,570 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,570 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:43,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:43,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:43,575 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-07-23 13:36:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:44,584 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-07-23 13:36:44,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:44,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:44,591 INFO L225 Difference]: With dead ends: 791 [2018-07-23 13:36:44,591 INFO L226 Difference]: Without dead ends: 783 [2018-07-23 13:36:44,592 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:36:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-07-23 13:36:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-07-23 13:36:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-07-23 13:36:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-07-23 13:36:44,774 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-07-23 13:36:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-07-23 13:36:44,775 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-07-23 13:36:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:44,776 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:44,776 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:44,777 INFO L414 AbstractCegarLoop]: === Iteration 9 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-07-23 13:36:44,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:44,798 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,799 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:44,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:44,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:44,800 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,800 INFO L185 omatonBuilderFactory]: Interpolants [13363#true, 13364#false, 13365#(< 0.0 product__global_workload), 13366#(< product__local__threadpooling_begin_0 product__global_next), 13367#(< product__local__threadpooling_begin_0 product__local__threadpooling_begin_1), 13368#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 13369#(< product__local__threadpooling_working_0 product__local__threadpooling_begin_1), 13370#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1), 13371#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1)] [2018-07-23 13:36:44,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:36:44,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:44,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:44,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:44,806 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-07-23 13:36:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:46,122 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-07-23 13:36:46,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:36:46,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:46,132 INFO L225 Difference]: With dead ends: 1040 [2018-07-23 13:36:46,132 INFO L226 Difference]: Without dead ends: 1032 [2018-07-23 13:36:46,134 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:36:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-07-23 13:36:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-07-23 13:36:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-07-23 13:36:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-07-23 13:36:46,325 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-07-23 13:36:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:46,325 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-07-23 13:36:46,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-07-23 13:36:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:46,326 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:46,326 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:46,327 INFO L414 AbstractCegarLoop]: === Iteration 10 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-07-23 13:36:46,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:46,345 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,346 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:46,346 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:46,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:46,347 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,347 INFO L185 omatonBuilderFactory]: Interpolants [16304#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 16296#true, 16297#false, 16298#(< 0.0 product__global_workload), 16299#(< product__local__threadpooling_begin_0 product__global_next), 16300#(< product__local__threadpooling_begin_0 product__local__threadpooling_begin_1), 16301#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 16302#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 16303#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1)] [2018-07-23 13:36:46,347 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,347 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:46,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:46,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:46,348 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-07-23 13:36:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:47,847 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-07-23 13:36:47,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:36:47,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:47,856 INFO L225 Difference]: With dead ends: 1166 [2018-07-23 13:36:47,856 INFO L226 Difference]: Without dead ends: 1158 [2018-07-23 13:36:47,858 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:36:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-07-23 13:36:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-07-23 13:36:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-07-23 13:36:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-07-23 13:36:48,070 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-07-23 13:36:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:48,071 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-07-23 13:36:48,071 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-07-23 13:36:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:48,072 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:48,072 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:48,072 INFO L414 AbstractCegarLoop]: === Iteration 11 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-07-23 13:36:48,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:48,088 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,088 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:48,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:48,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:48,089 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,089 INFO L185 omatonBuilderFactory]: Interpolants [19552#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 19553#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 19554#(< product__local__threadpooling_i_0 product__local__threadpooling_working_1), 19555#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 19547#true, 19548#false, 19549#(< 0.0 product__global_workload), 19550#(< product__local__threadpooling_begin_0 product__global_next), 19551#(< product__local__threadpooling_begin_0 product__local__threadpooling_begin_1)] [2018-07-23 13:36:48,090 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,090 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:48,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:48,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:48,091 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-07-23 13:36:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:49,658 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-07-23 13:36:49,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:36:49,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:49,666 INFO L225 Difference]: With dead ends: 1127 [2018-07-23 13:36:49,666 INFO L226 Difference]: Without dead ends: 1119 [2018-07-23 13:36:49,668 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:36:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-07-23 13:36:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-07-23 13:36:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-07-23 13:36:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-07-23 13:36:49,886 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-07-23 13:36:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:49,886 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-07-23 13:36:49,887 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-07-23 13:36:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:49,888 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:49,888 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:49,888 INFO L414 AbstractCegarLoop]: === Iteration 12 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-07-23 13:36:49,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:49,907 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,907 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:49,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:49,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:49,908 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,909 INFO L185 omatonBuilderFactory]: Interpolants [22640#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 22641#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1), 22642#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 22634#true, 22635#false, 22636#(< 0.0 product__global_workload), 22637#(< product__local__threadpooling_begin_0 product__global_next), 22638#(< product__local__threadpooling_begin_0 product__local__threadpooling_begin_1), 22639#(< product__local__threadpooling_begin_0 product__local__threadpooling_i_1)] [2018-07-23 13:36:49,909 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,909 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:49,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:49,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:49,910 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-07-23 13:36:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:51,292 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-07-23 13:36:51,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:36:51,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:51,299 INFO L225 Difference]: With dead ends: 975 [2018-07-23 13:36:51,299 INFO L226 Difference]: Without dead ends: 967 [2018-07-23 13:36:51,301 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:36:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-07-23 13:36:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-07-23 13:36:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-07-23 13:36:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-07-23 13:36:51,569 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-07-23 13:36:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:51,571 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-07-23 13:36:51,571 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-07-23 13:36:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:51,577 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:51,577 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:51,578 INFO L414 AbstractCegarLoop]: === Iteration 13 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-07-23 13:36:51,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:51,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:36:51,593 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:51,593 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:51,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:51,594 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,594 INFO L185 omatonBuilderFactory]: Interpolants [25456#false, 25457#(< 0.0 product__global_workload), 25458#(< product__local__threadpooling_begin_0 product__global_next), 25459#(< product__local__threadpooling_begin_0 product__local__threadpooling_begin_1), 25460#(< product__local__threadpooling_begin_0 product__local__threadpooling_i_1), 25461#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 25462#(< product__local__threadpooling_i_0 product__local__threadpooling_working_1), 25463#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 25455#true] [2018-07-23 13:36:51,594 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,594 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:51,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:51,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:51,595 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-07-23 13:36:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:53,227 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-07-23 13:36:53,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:36:53,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:53,235 INFO L225 Difference]: With dead ends: 1011 [2018-07-23 13:36:53,235 INFO L226 Difference]: Without dead ends: 1003 [2018-07-23 13:36:53,238 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:36:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-07-23 13:36:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-07-23 13:36:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-07-23 13:36:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-07-23 13:36:53,563 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-07-23 13:36:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:53,564 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-07-23 13:36:53,564 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-07-23 13:36:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:53,565 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:53,565 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:53,565 INFO L414 AbstractCegarLoop]: === Iteration 14 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-07-23 13:36:53,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:53,579 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,579 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:53,579 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:53,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:53,580 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,580 INFO L185 omatonBuilderFactory]: Interpolants [28308#true, 28309#false, 28310#(< 0.0 product__global_workload), 28311#(< product__local__threadpooling_begin_0 product__global_next), 28312#(< product__local__threadpooling_begin_0 product__local__threadpooling_begin_1), 28313#(< product__local__threadpooling_begin_0 product__local__threadpooling_i_1), 28314#(< product__local__threadpooling_begin_0 product__local__threadpooling_working_1), 28315#(< product__local__threadpooling_i_0 product__local__threadpooling_working_1), 28316#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1)] [2018-07-23 13:36:53,581 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,581 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:36:53,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:36:53,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:36:53,582 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-07-23 13:36:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:54,848 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-07-23 13:36:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:36:54,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:36:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:54,853 INFO L225 Difference]: With dead ends: 859 [2018-07-23 13:36:54,854 INFO L226 Difference]: Without dead ends: 851 [2018-07-23 13:36:54,855 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:36:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-07-23 13:36:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-07-23 13:36:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-23 13:36:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-07-23 13:36:55,156 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-07-23 13:36:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:55,156 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-07-23 13:36:55,156 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:36:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-07-23 13:36:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:55,157 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:55,157 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:55,157 INFO L414 AbstractCegarLoop]: === Iteration 15 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:55,157 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-07-23 13:36:55,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:55,181 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,181 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:55,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:55,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:55,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:55,182 INFO L185 omatonBuilderFactory]: Interpolants [30823#true, 30824#false, 30825#(= product__local__threadpooling_end_1 product__global_next), 30826#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 30827#(= product__local__threadpooling_end_1 product__local__threadpooling_i_0), 30828#(= product__local__threadpooling_end_1 product__local__threadpooling_working_0), 30829#(< product__local__threadpooling_i_1 product__local__threadpooling_working_0), 30830#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:55,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:55,183 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:55,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:55,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:55,183 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-07-23 13:36:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:56,428 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-07-23 13:36:56,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:36:56,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:36:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:56,435 INFO L225 Difference]: With dead ends: 962 [2018-07-23 13:36:56,435 INFO L226 Difference]: Without dead ends: 954 [2018-07-23 13:36:56,436 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:36:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-07-23 13:36:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-07-23 13:36:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-07-23 13:36:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-07-23 13:36:56,841 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-07-23 13:36:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:56,842 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-07-23 13:36:56,842 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-07-23 13:36:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:56,843 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:56,843 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:56,843 INFO L414 AbstractCegarLoop]: === Iteration 16 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-07-23 13:36:56,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:56,853 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,853 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:56,853 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:56,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:56,854 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,854 INFO L185 omatonBuilderFactory]: Interpolants [33797#true, 33798#false, 33799#(= product__local__threadpooling_end_1 product__global_next), 33800#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 33801#(= product__local__threadpooling_end_1 product__local__threadpooling_i_0), 33802#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 33803#(< product__local__threadpooling_i_1 product__local__threadpooling_working_0), 33804#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:56,854 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,855 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:56,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:56,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:56,855 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-07-23 13:36:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:58,296 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-07-23 13:36:58,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:36:58,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:36:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:58,303 INFO L225 Difference]: With dead ends: 1064 [2018-07-23 13:36:58,303 INFO L226 Difference]: Without dead ends: 1056 [2018-07-23 13:36:58,304 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:36:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-07-23 13:36:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-07-23 13:36:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-07-23 13:36:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-07-23 13:36:58,792 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-07-23 13:36:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:58,792 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-07-23 13:36:58,792 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-07-23 13:36:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:36:58,793 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:58,793 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:58,793 INFO L414 AbstractCegarLoop]: === Iteration 17 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:36:58,794 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-07-23 13:36:58,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:58,806 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,807 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:58,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:36:58,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:58,808 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,808 INFO L185 omatonBuilderFactory]: Interpolants [37024#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 37017#true, 37018#false, 37019#(= product__local__threadpooling_end_1 product__global_next), 37020#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 37021#(= product__local__threadpooling_end_1 product__local__threadpooling_i_0), 37022#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 37023#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))] [2018-07-23 13:36:58,808 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,808 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:58,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:58,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:58,809 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-07-23 13:37:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:00,584 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-07-23 13:37:00,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:37:00,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:37:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:00,592 INFO L225 Difference]: With dead ends: 1241 [2018-07-23 13:37:00,592 INFO L226 Difference]: Without dead ends: 1233 [2018-07-23 13:37:00,594 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:37:00,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-07-23 13:37:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-07-23 13:37:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-07-23 13:37:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-07-23 13:37:01,155 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-07-23 13:37:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:01,155 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-07-23 13:37:01,156 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-07-23 13:37:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:01,157 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:01,157 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:01,157 INFO L414 AbstractCegarLoop]: === Iteration 18 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:01,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-07-23 13:37:01,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:01,171 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,172 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:01,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:01,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:01,175 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,175 INFO L185 omatonBuilderFactory]: Interpolants [40704#true, 40705#false, 40706#(= product__local__threadpooling_end_1 product__global_next), 40707#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 40708#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 40709#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 40710#(< product__local__threadpooling_i_1 product__local__threadpooling_working_0), 40711#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:37:01,176 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,176 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:01,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:01,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:01,177 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-07-23 13:37:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:02,560 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-07-23 13:37:02,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:02,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:37:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:02,568 INFO L225 Difference]: With dead ends: 1139 [2018-07-23 13:37:02,568 INFO L226 Difference]: Without dead ends: 1131 [2018-07-23 13:37:02,569 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-07-23 13:37:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-07-23 13:37:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-07-23 13:37:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-07-23 13:37:02,936 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-07-23 13:37:02,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:02,937 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-07-23 13:37:02,937 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-07-23 13:37:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:02,938 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:02,938 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:02,939 INFO L414 AbstractCegarLoop]: === Iteration 19 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-07-23 13:37:02,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:02,947 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,947 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:02,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:02,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:02,948 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,948 INFO L185 omatonBuilderFactory]: Interpolants [44192#(= product__local__threadpooling_end_1 product__global_next), 44193#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 44194#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 44195#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 44196#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 44197#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 44190#true, 44191#false] [2018-07-23 13:37:02,948 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,948 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:02,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:02,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:02,949 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-07-23 13:37:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:04,530 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-07-23 13:37:04,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:04,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:37:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:04,538 INFO L225 Difference]: With dead ends: 1325 [2018-07-23 13:37:04,538 INFO L226 Difference]: Without dead ends: 1317 [2018-07-23 13:37:04,539 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-07-23 13:37:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-07-23 13:37:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-07-23 13:37:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-07-23 13:37:04,950 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-07-23 13:37:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:04,951 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-07-23 13:37:04,951 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-07-23 13:37:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:04,952 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:04,952 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:04,952 INFO L414 AbstractCegarLoop]: === Iteration 20 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-07-23 13:37:04,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:04,960 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,960 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:04,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:04,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:04,961 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,961 INFO L185 omatonBuilderFactory]: Interpolants [48032#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 48033#(not (= product__local__threadpooling_working_1 product__local__threadpooling_begin_0)), 48034#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 48035#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 48028#true, 48029#false, 48030#(= product__local__threadpooling_end_1 product__global_next), 48031#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0)] [2018-07-23 13:37:04,961 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,962 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:04,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:04,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:04,962 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-07-23 13:37:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:06,382 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-07-23 13:37:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:06,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:37:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:06,390 INFO L225 Difference]: With dead ends: 1334 [2018-07-23 13:37:06,390 INFO L226 Difference]: Without dead ends: 1326 [2018-07-23 13:37:06,391 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-07-23 13:37:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-07-23 13:37:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-07-23 13:37:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-07-23 13:37:06,830 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-07-23 13:37:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:06,830 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-07-23 13:37:06,830 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-07-23 13:37:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:06,831 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:06,832 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:06,832 INFO L414 AbstractCegarLoop]: === Iteration 21 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-07-23 13:37:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:06,839 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:06,839 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:06,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:06,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:06,840 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:06,840 INFO L185 omatonBuilderFactory]: Interpolants [51904#true, 51905#false, 51906#(= product__local__threadpooling_end_1 product__global_next), 51907#(< product__local__threadpooling_i_1 product__global_next), 51908#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 51909#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 51910#(< product__local__threadpooling_i_1 product__local__threadpooling_working_0), 51911#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:37:06,840 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:06,841 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:06,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:06,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:06,841 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-07-23 13:37:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:07,657 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-07-23 13:37:07,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:07,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:37:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:07,662 INFO L225 Difference]: With dead ends: 919 [2018-07-23 13:37:07,662 INFO L226 Difference]: Without dead ends: 911 [2018-07-23 13:37:07,663 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-07-23 13:37:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-07-23 13:37:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-07-23 13:37:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-07-23 13:37:08,024 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-07-23 13:37:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:08,024 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-07-23 13:37:08,024 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-07-23 13:37:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:08,025 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:08,025 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:08,026 INFO L414 AbstractCegarLoop]: === Iteration 22 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:08,026 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-07-23 13:37:08,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:08,033 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:08,033 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:08,033 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:08,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:08,033 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:08,034 INFO L185 omatonBuilderFactory]: Interpolants [54913#true, 54914#false, 54915#(= product__local__threadpooling_end_1 product__global_next), 54916#(< product__local__threadpooling_i_1 product__global_next), 54917#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 54918#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 54919#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 54920#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:37:08,034 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:08,034 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:08,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:08,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:08,035 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-07-23 13:37:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:09,201 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-07-23 13:37:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:09,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:37:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:09,206 INFO L225 Difference]: With dead ends: 1095 [2018-07-23 13:37:09,206 INFO L226 Difference]: Without dead ends: 1087 [2018-07-23 13:37:09,206 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-07-23 13:37:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-07-23 13:37:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-07-23 13:37:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-07-23 13:37:09,619 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-07-23 13:37:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:09,620 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-07-23 13:37:09,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-07-23 13:37:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:09,621 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:09,621 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:09,621 INFO L414 AbstractCegarLoop]: === Iteration 23 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-07-23 13:37:09,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:09,628 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,628 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:09,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:09,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:09,629 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,629 INFO L185 omatonBuilderFactory]: Interpolants [58256#(= product__local__threadpooling_end_1 product__global_next), 58257#(< product__local__threadpooling_i_1 product__global_next), 58258#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 58259#(not (= product__local__threadpooling_working_1 product__local__threadpooling_begin_0)), 58260#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 58261#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 58254#true, 58255#false] [2018-07-23 13:37:09,629 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,629 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:09,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:09,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:09,630 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-07-23 13:37:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:11,194 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-07-23 13:37:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:37:11,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:37:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:11,199 INFO L225 Difference]: With dead ends: 1304 [2018-07-23 13:37:11,199 INFO L226 Difference]: Without dead ends: 1296 [2018-07-23 13:37:11,200 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:37:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-07-23 13:37:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-07-23 13:37:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-07-23 13:37:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-07-23 13:37:11,637 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-07-23 13:37:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:11,637 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-07-23 13:37:11,638 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-07-23 13:37:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:11,638 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:11,639 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:11,639 INFO L414 AbstractCegarLoop]: === Iteration 24 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:11,639 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-07-23 13:37:11,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:11,645 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:11,646 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:11,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:11,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:11,646 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:11,647 INFO L185 omatonBuilderFactory]: Interpolants [62019#true, 62020#false, 62021#(= product__local__threadpooling_end_1 product__global_next), 62022#(< product__local__threadpooling_i_1 product__global_next), 62023#(not (= product__local__threadpooling_working_1 product__global_next)), 62024#(not (= product__local__threadpooling_working_1 product__local__threadpooling_begin_0)), 62025#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 62026#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:37:11,647 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:11,647 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:11,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:11,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:11,648 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-07-23 13:37:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:12,981 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-07-23 13:37:12,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:37:12,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:37:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:12,984 INFO L225 Difference]: With dead ends: 1192 [2018-07-23 13:37:12,984 INFO L226 Difference]: Without dead ends: 1184 [2018-07-23 13:37:12,984 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:37:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-07-23 13:37:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-07-23 13:37:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-07-23 13:37:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-07-23 13:37:13,463 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-07-23 13:37:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:13,463 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-07-23 13:37:13,463 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-07-23 13:37:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:13,464 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:13,464 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:13,465 INFO L414 AbstractCegarLoop]: === Iteration 25 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-07-23 13:37:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:13,470 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:13,470 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:13,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:37:13,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:13,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:13,471 INFO L185 omatonBuilderFactory]: Interpolants [65669#true, 65671#(< 0.0 product__global_workload), 65670#false, 65673#(< product__local__threadpooling_i_0 product__local__threadpooling_end_0), 65672#(< product__local__threadpooling_begin_0 product__local__threadpooling_end_0)] [2018-07-23 13:37:13,471 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:13,471 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:37:13,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:37:13,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:37:13,472 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-07-23 13:37:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:14,041 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-07-23 13:37:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:37:14,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-07-23 13:37:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:14,043 INFO L225 Difference]: With dead ends: 1139 [2018-07-23 13:37:14,043 INFO L226 Difference]: Without dead ends: 625 [2018-07-23 13:37:14,045 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-07-23 13:37:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-07-23 13:37:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-07-23 13:37:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-07-23 13:37:14,541 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-07-23 13:37:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:14,541 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-07-23 13:37:14,541 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:37:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-07-23 13:37:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:14,542 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:14,542 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:14,542 INFO L414 AbstractCegarLoop]: === Iteration 26 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-07-23 13:37:14,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:14,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:14,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:14,567 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:14,567 INFO L185 omatonBuilderFactory]: Interpolants [69168#(< (+ product__local__threadpooling_working_1 3.0) product__local__threadpooling_working_0), 69161#false, 69160#true, 69163#(< (+ product__local__threadpooling_working_1 product__global_workload 1.0) product__global_next), 69162#(< (+ product__local__threadpooling_working_1 1.0) product__global_next), 69165#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_working_1 1.0) (* 2.0 product__local__threadpooling_i_0)), 69164#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_working_1 1.0) (* 2.0 product__local__threadpooling_begin_0)), 69167#(< (+ product__local__threadpooling_working_1 3.0) product__local__threadpooling_i_0), 69166#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_working_1 3.0) (* 2.0 product__local__threadpooling_i_0))] [2018-07-23 13:37:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:14,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:14,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:14,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:14,572 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 9 states. [2018-07-23 13:37:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:15,719 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-07-23 13:37:15,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:15,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:15,721 INFO L225 Difference]: With dead ends: 794 [2018-07-23 13:37:15,721 INFO L226 Difference]: Without dead ends: 789 [2018-07-23 13:37:15,722 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-07-23 13:37:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-07-23 13:37:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-07-23 13:37:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-07-23 13:37:16,437 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-07-23 13:37:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:16,437 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-07-23 13:37:16,437 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-07-23 13:37:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:16,438 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:16,438 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:16,438 INFO L414 AbstractCegarLoop]: === Iteration 27 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-07-23 13:37:16,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,445 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:16,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:37:16,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:16,446 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,446 INFO L185 omatonBuilderFactory]: Interpolants [72097#(< 0.0 product__global_workload), 72096#false, 72099#(< product__local__threadpooling_i_1 product__local__threadpooling_end_1), 72098#(< product__local__threadpooling_begin_1 product__local__threadpooling_end_1), 72095#true] [2018-07-23 13:37:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,446 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:37:16,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:37:16,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:37:16,447 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-07-23 13:37:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:17,507 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-07-23 13:37:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:37:17,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-07-23 13:37:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:17,510 INFO L225 Difference]: With dead ends: 1317 [2018-07-23 13:37:17,510 INFO L226 Difference]: Without dead ends: 729 [2018-07-23 13:37:17,511 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-07-23 13:37:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-07-23 13:37:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-07-23 13:37:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-07-23 13:37:18,157 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-07-23 13:37:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,157 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-07-23 13:37:18,157 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:37:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-07-23 13:37:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:18,159 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,159 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:18,159 INFO L414 AbstractCegarLoop]: === Iteration 28 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-07-23 13:37:18,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,167 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,168 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:18,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:18,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,168 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,169 INFO L185 omatonBuilderFactory]: Interpolants [76119#false, 76118#true, 76121#(<= product__local__threadpooling_end_0 product__local__threadpooling_begin_1), 76120#(<= product__local__threadpooling_end_0 product__global_next), 76123#(< product__local__threadpooling_working_0 product__local__threadpooling_begin_1), 76122#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 76125#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 76124#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1)] [2018-07-23 13:37:18,169 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,169 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:18,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:18,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:18,170 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-07-23 13:37:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:20,341 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-07-23 13:37:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:20,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:20,344 INFO L225 Difference]: With dead ends: 1435 [2018-07-23 13:37:20,345 INFO L226 Difference]: Without dead ends: 1427 [2018-07-23 13:37:20,345 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-07-23 13:37:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-07-23 13:37:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-07-23 13:37:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-07-23 13:37:21,195 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-07-23 13:37:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:21,195 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-07-23 13:37:21,195 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-07-23 13:37:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:21,196 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:21,196 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:21,196 INFO L414 AbstractCegarLoop]: === Iteration 29 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-07-23 13:37:21,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:21,204 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,204 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:21,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:21,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:21,205 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,205 INFO L185 omatonBuilderFactory]: Interpolants [80611#false, 80610#true, 80613#(<= product__local__threadpooling_end_0 product__local__threadpooling_begin_1), 80612#(<= product__local__threadpooling_end_0 product__global_next), 80615#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 80614#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 80617#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 80616#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1)] [2018-07-23 13:37:21,205 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,205 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:21,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:21,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:21,206 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-07-23 13:37:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:22,865 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-07-23 13:37:22,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:22,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:22,869 INFO L225 Difference]: With dead ends: 1599 [2018-07-23 13:37:22,869 INFO L226 Difference]: Without dead ends: 1591 [2018-07-23 13:37:22,870 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-07-23 13:37:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-07-23 13:37:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-07-23 13:37:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-07-23 13:37:23,794 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-07-23 13:37:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:23,795 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-07-23 13:37:23,795 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-07-23 13:37:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:23,795 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:23,796 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:23,796 INFO L414 AbstractCegarLoop]: === Iteration 30 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-07-23 13:37:23,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:23,803 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,803 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:23,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:23,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:23,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:37:23,804 INFO L185 omatonBuilderFactory]: Interpolants [85495#false, 85494#true, 85497#(<= product__local__threadpooling_end_0 product__local__threadpooling_begin_1), 85496#(<= product__local__threadpooling_end_0 product__global_next), 85499#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 85498#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 85501#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 85500#(< product__local__threadpooling_i_0 product__local__threadpooling_working_1)] [2018-07-23 13:37:23,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:37:23,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:23,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:23,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:23,805 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-07-23 13:37:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:25,328 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-07-23 13:37:25,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:25,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:25,332 INFO L225 Difference]: With dead ends: 1411 [2018-07-23 13:37:25,332 INFO L226 Difference]: Without dead ends: 1403 [2018-07-23 13:37:25,333 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-07-23 13:37:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-07-23 13:37:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-07-23 13:37:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-07-23 13:37:26,284 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-07-23 13:37:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:26,284 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-07-23 13:37:26,284 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-07-23 13:37:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:26,285 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:26,285 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:26,285 INFO L414 AbstractCegarLoop]: === Iteration 31 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-07-23 13:37:26,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:26,292 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,292 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:26,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:26,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:26,293 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,293 INFO L185 omatonBuilderFactory]: Interpolants [90000#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 89993#true, 89995#(<= product__local__threadpooling_end_0 product__global_next), 89994#false, 89997#(<= product__local__threadpooling_end_0 product__local__threadpooling_i_1), 89996#(<= product__local__threadpooling_end_0 product__local__threadpooling_begin_1), 89999#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1), 89998#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1)] [2018-07-23 13:37:26,293 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,293 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:26,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:26,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:26,294 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-07-23 13:37:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:27,878 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-07-23 13:37:27,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:27,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:27,880 INFO L225 Difference]: With dead ends: 1490 [2018-07-23 13:37:27,881 INFO L226 Difference]: Without dead ends: 1482 [2018-07-23 13:37:27,881 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-07-23 13:37:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-07-23 13:37:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-07-23 13:37:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-07-23 13:37:28,788 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-07-23 13:37:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:28,788 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-07-23 13:37:28,788 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-07-23 13:37:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:28,789 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:28,789 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:28,789 INFO L414 AbstractCegarLoop]: === Iteration 32 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:28,790 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-07-23 13:37:28,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:28,797 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,797 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:28,798 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:28,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:28,798 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,798 INFO L185 omatonBuilderFactory]: Interpolants [94913#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 94912#(< product__local__threadpooling_i_0 product__local__threadpooling_working_1), 94907#false, 94906#true, 94909#(<= product__local__threadpooling_end_0 product__local__threadpooling_begin_1), 94908#(<= product__local__threadpooling_end_0 product__global_next), 94911#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 94910#(<= product__local__threadpooling_end_0 product__local__threadpooling_i_1)] [2018-07-23 13:37:28,798 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,799 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:28,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:28,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:28,799 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-07-23 13:37:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,278 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-07-23 13:37:30,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:37:30,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,281 INFO L225 Difference]: With dead ends: 1427 [2018-07-23 13:37:30,281 INFO L226 Difference]: Without dead ends: 1419 [2018-07-23 13:37:30,282 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:37:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-07-23 13:37:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-07-23 13:37:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-07-23 13:37:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-07-23 13:37:31,140 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-07-23 13:37:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:31,140 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-07-23 13:37:31,140 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-07-23 13:37:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:31,141 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:31,141 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:31,141 INFO L414 AbstractCegarLoop]: === Iteration 33 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:31,142 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-07-23 13:37:31,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:31,147 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:31,147 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:31,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:31,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:31,147 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:31,148 INFO L185 omatonBuilderFactory]: Interpolants [99653#false, 99652#true, 99655#(<= product__local__threadpooling_end_0 product__local__threadpooling_begin_1), 99654#(<= product__local__threadpooling_end_0 product__global_next), 99657#(<= product__local__threadpooling_end_0 product__local__threadpooling_working_1), 99656#(<= product__local__threadpooling_end_0 product__local__threadpooling_i_1), 99659#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 99658#(< product__local__threadpooling_i_0 product__local__threadpooling_working_1)] [2018-07-23 13:37:31,148 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:31,148 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:31,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:31,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:31,149 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-07-23 13:37:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:32,690 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-07-23 13:37:32,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:37:32,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:32,692 INFO L225 Difference]: With dead ends: 1306 [2018-07-23 13:37:32,692 INFO L226 Difference]: Without dead ends: 1298 [2018-07-23 13:37:32,693 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-07-23 13:37:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-07-23 13:37:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-07-23 13:37:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-07-23 13:37:33,672 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-07-23 13:37:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:33,673 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-07-23 13:37:33,673 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-07-23 13:37:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:33,674 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:33,674 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:33,674 INFO L414 AbstractCegarLoop]: === Iteration 34 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-07-23 13:37:33,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:33,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:33,685 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:33,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:33,685 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:33,685 INFO L185 omatonBuilderFactory]: Interpolants [104277#false, 104276#true, 104279#(< product__local__threadpooling_i_0 product__global_next), 104278#(<= product__local__threadpooling_end_0 product__global_next), 104281#(< product__local__threadpooling_working_0 product__local__threadpooling_begin_1), 104280#(< product__local__threadpooling_working_0 product__global_next), 104283#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 104282#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1)] [2018-07-23 13:37:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:33,685 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:33,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:33,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:33,686 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-07-23 13:37:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:35,070 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-07-23 13:37:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:35,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:35,073 INFO L225 Difference]: With dead ends: 1285 [2018-07-23 13:37:35,073 INFO L226 Difference]: Without dead ends: 1277 [2018-07-23 13:37:35,074 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-07-23 13:37:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-07-23 13:37:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-07-23 13:37:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-07-23 13:37:36,573 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-07-23 13:37:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:36,573 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-07-23 13:37:36,573 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-07-23 13:37:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:36,574 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:36,574 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:36,574 INFO L414 AbstractCegarLoop]: === Iteration 35 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-07-23 13:37:36,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:36,581 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:36,581 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:36,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:36,582 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:36,582 INFO L185 omatonBuilderFactory]: Interpolants [108865#(< product__local__threadpooling_working_0 product__local__threadpooling_begin_1), 108864#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 108867#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 108866#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1), 108861#false, 108860#true, 108863#(< product__local__threadpooling_i_0 product__global_next), 108862#(<= product__local__threadpooling_end_0 product__global_next)] [2018-07-23 13:37:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:36,582 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:36,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:36,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:36,583 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-07-23 13:37:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:38,265 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-07-23 13:37:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:37:38,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:38,267 INFO L225 Difference]: With dead ends: 1518 [2018-07-23 13:37:38,267 INFO L226 Difference]: Without dead ends: 1510 [2018-07-23 13:37:38,268 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-07-23 13:37:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-07-23 13:37:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-07-23 13:37:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-07-23 13:37:39,238 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-07-23 13:37:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:39,238 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-07-23 13:37:39,238 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-07-23 13:37:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:39,239 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:39,239 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:39,239 INFO L414 AbstractCegarLoop]: === Iteration 36 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:39,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-07-23 13:37:39,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:39,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:39,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:39,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:39,247 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:39,247 INFO L185 omatonBuilderFactory]: Interpolants [113904#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 113897#true, 113899#(<= product__local__threadpooling_end_0 product__global_next), 113898#false, 113901#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 113900#(< product__local__threadpooling_i_0 product__global_next), 113903#(< product__local__threadpooling_working_0 product__local__threadpooling_i_1), 113902#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1)] [2018-07-23 13:37:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:39,248 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:39,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:39,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:39,248 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-07-23 13:37:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:41,060 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-07-23 13:37:41,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:41,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:41,062 INFO L225 Difference]: With dead ends: 1448 [2018-07-23 13:37:41,062 INFO L226 Difference]: Without dead ends: 1440 [2018-07-23 13:37:41,062 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-07-23 13:37:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-07-23 13:37:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-07-23 13:37:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-07-23 13:37:42,045 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-07-23 13:37:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:42,045 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-07-23 13:37:42,045 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-07-23 13:37:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:42,046 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:42,046 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:42,046 INFO L414 AbstractCegarLoop]: === Iteration 37 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:42,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-07-23 13:37:42,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:42,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:42,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:42,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:42,055 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:42,055 INFO L185 omatonBuilderFactory]: Interpolants [118721#(< product__local__threadpooling_i_0 product__local__threadpooling_i_1), 118720#(< product__local__threadpooling_i_0 product__local__threadpooling_begin_1), 118723#(< product__local__threadpooling_working_0 product__local__threadpooling_working_1), 118722#(< product__local__threadpooling_i_0 product__local__threadpooling_working_1), 118717#false, 118716#true, 118719#(< product__local__threadpooling_i_0 product__global_next), 118718#(<= product__local__threadpooling_end_0 product__global_next)] [2018-07-23 13:37:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:42,055 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:42,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:42,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:42,056 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-07-23 13:37:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:43,527 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-07-23 13:37:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:37:43,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 13:37:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:43,529 INFO L225 Difference]: With dead ends: 1254 [2018-07-23 13:37:43,529 INFO L226 Difference]: Without dead ends: 1246 [2018-07-23 13:37:43,530 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-07-23 13:37:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-07-23 13:37:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-07-23 13:37:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-07-23 13:37:44,485 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-07-23 13:37:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:44,486 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-07-23 13:37:44,486 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-07-23 13:37:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:44,487 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:44,487 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:44,487 INFO L414 AbstractCegarLoop]: === Iteration 38 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-07-23 13:37:44,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,495 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:44,495 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:44,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:44,496 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:44,496 INFO L185 omatonBuilderFactory]: Interpolants [123047#false, 123046#true, 123049#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 123048#(= product__local__threadpooling_end_1 product__global_next), 123051#(<= (+ product__local__threadpooling_end_1 1.0) product__local__threadpooling_i_0), 123050#(= product__local__threadpooling_i_0 product__local__threadpooling_end_1), 123053#(< (+ product__local__threadpooling_i_1 1.0) product__local__threadpooling_working_0), 123052#(<= (+ product__local__threadpooling_end_1 1.0) product__local__threadpooling_working_0), 123054#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0)] [2018-07-23 13:37:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,496 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:44,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:44,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:44,497 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 9 states. [2018-07-23 13:37:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:46,031 INFO L93 Difference]: Finished difference Result 1152 states and 2509 transitions. [2018-07-23 13:37:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:46,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:37:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:46,033 INFO L225 Difference]: With dead ends: 1152 [2018-07-23 13:37:46,033 INFO L226 Difference]: Without dead ends: 1144 [2018-07-23 13:37:46,034 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-07-23 13:37:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 970. [2018-07-23 13:37:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-07-23 13:37:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-07-23 13:37:47,032 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-07-23 13:37:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:47,032 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-07-23 13:37:47,032 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-07-23 13:37:47,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:47,033 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:47,034 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:47,034 INFO L414 AbstractCegarLoop]: === Iteration 39 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:47,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-07-23 13:37:47,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:47,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:47,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:47,043 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:47,044 INFO L185 omatonBuilderFactory]: Interpolants [127335#false, 127334#true, 127337#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 127336#(= product__local__threadpooling_end_1 product__global_next), 127339#(<= (+ product__local__threadpooling_end_1 1.0) product__local__threadpooling_i_0), 127338#(= product__local__threadpooling_i_0 product__local__threadpooling_end_1), 127341#(< (+ product__local__threadpooling_i_1 1.0) product__local__threadpooling_working_0), 127340#(< (+ product__local__threadpooling_i_1 1.0) product__local__threadpooling_i_0), 127342#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0)] [2018-07-23 13:37:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,044 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:47,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:47,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:47,045 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-07-23 13:37:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:48,416 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-07-23 13:37:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:48,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:37:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:48,418 INFO L225 Difference]: With dead ends: 1180 [2018-07-23 13:37:48,418 INFO L226 Difference]: Without dead ends: 1172 [2018-07-23 13:37:48,419 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-07-23 13:37:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-07-23 13:37:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-07-23 13:37:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-07-23 13:37:49,431 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-07-23 13:37:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:49,431 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-07-23 13:37:49,431 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-07-23 13:37:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:49,432 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:49,432 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:49,432 INFO L414 AbstractCegarLoop]: === Iteration 40 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-07-23 13:37:49,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:49,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:49,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:49,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:49,442 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,442 INFO L185 omatonBuilderFactory]: Interpolants [131634#false, 131635#(= product__local__threadpooling_end_1 product__global_next), 131633#true, 131638#(<= (+ product__local__threadpooling_end_1 1.0) product__local__threadpooling_i_0), 131639#(< (+ product__local__threadpooling_i_1 1.0) product__local__threadpooling_i_0), 131636#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 131637#(= product__local__threadpooling_i_0 product__local__threadpooling_end_1), 131640#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 131641#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0)] [2018-07-23 13:37:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:49,443 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:49,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:49,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:49,443 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-07-23 13:37:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:51,015 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-07-23 13:37:51,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:51,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:37:51,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:51,017 INFO L225 Difference]: With dead ends: 1233 [2018-07-23 13:37:51,017 INFO L226 Difference]: Without dead ends: 1225 [2018-07-23 13:37:51,018 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:37:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-07-23 13:37:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-07-23 13:37:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-07-23 13:37:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-07-23 13:37:52,079 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-07-23 13:37:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:52,079 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-07-23 13:37:52,080 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-07-23 13:37:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:52,081 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:52,081 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:52,081 INFO L414 AbstractCegarLoop]: === Iteration 41 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-07-23 13:37:52,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:52,088 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,088 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:52,088 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-07-23 13:37:52,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:52,089 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,089 INFO L185 omatonBuilderFactory]: Interpolants [136082#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 136083#(= product__local__threadpooling_i_0 product__local__threadpooling_end_1), 136080#false, 136081#(= product__local__threadpooling_end_1 product__global_next), 136086#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 136087#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0), 136084#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 136085#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 136079#true] [2018-07-23 13:37:52,089 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,089 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:52,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:52,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:52,089 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-07-23 13:37:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:53,918 INFO L93 Difference]: Finished difference Result 1465 states and 3226 transitions. [2018-07-23 13:37:53,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:37:53,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:37:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:53,921 INFO L225 Difference]: With dead ends: 1465 [2018-07-23 13:37:53,921 INFO L226 Difference]: Without dead ends: 1457 [2018-07-23 13:37:53,921 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:37:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-07-23 13:37:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1013. [2018-07-23 13:37:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-07-23 13:37:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-07-23 13:37:55,027 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-07-23 13:37:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:55,027 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-07-23 13:37:55,027 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-07-23 13:37:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:55,028 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:55,028 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:55,029 INFO L414 AbstractCegarLoop]: === Iteration 42 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-07-23 13:37:55,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:55,038 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,038 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:55,038 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-07-23 13:37:55,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:55,039 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,039 INFO L185 omatonBuilderFactory]: Interpolants [141090#false, 141091#(= product__local__threadpooling_end_1 product__global_next), 141089#true, 141094#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 141095#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 141092#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 141093#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 141096#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 141097#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0)] [2018-07-23 13:37:55,039 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,039 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:55,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:55,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:55,040 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-07-23 13:37:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:57,080 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-07-23 13:37:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:37:57,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:37:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:57,082 INFO L225 Difference]: With dead ends: 1590 [2018-07-23 13:37:57,082 INFO L226 Difference]: Without dead ends: 1582 [2018-07-23 13:37:57,083 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:37:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-07-23 13:37:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-07-23 13:37:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-07-23 13:37:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-07-23 13:37:58,242 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-07-23 13:37:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:58,243 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-07-23 13:37:58,243 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-07-23 13:37:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:58,243 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:58,243 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:58,244 INFO L414 AbstractCegarLoop]: === Iteration 43 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:37:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-07-23 13:37:58,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:58,253 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:58,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:58,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:58,254 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,254 INFO L185 omatonBuilderFactory]: Interpolants [146370#(< product__local__threadpooling_working_1 product__local__threadpooling_begin_0), 146371#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 146368#(= product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 146369#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 146372#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 146373#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0), 146366#false, 146367#(= product__local__threadpooling_end_1 product__global_next), 146365#true] [2018-07-23 13:37:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:58,254 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:58,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:58,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:58,255 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 9 states. [2018-07-23 13:38:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:00,125 INFO L93 Difference]: Finished difference Result 1429 states and 3130 transitions. [2018-07-23 13:38:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:38:00,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:38:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:00,126 INFO L225 Difference]: With dead ends: 1429 [2018-07-23 13:38:00,127 INFO L226 Difference]: Without dead ends: 1421 [2018-07-23 13:38:00,127 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:38:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-07-23 13:38:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1031. [2018-07-23 13:38:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-07-23 13:38:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-07-23 13:38:01,483 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-07-23 13:38:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:01,483 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-07-23 13:38:01,483 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:38:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-07-23 13:38:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:38:01,484 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:01,484 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:01,484 INFO L414 AbstractCegarLoop]: === Iteration 44 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-07-23 13:38:01,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:01,491 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:01,491 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:38:01,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-07-23 13:38:01,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:01,492 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:01,492 INFO L185 omatonBuilderFactory]: Interpolants [151346#(< product__local__threadpooling_i_1 product__global_next), 151347#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 151344#false, 151345#(= product__local__threadpooling_end_1 product__global_next), 151350#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 151351#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0), 151348#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 151349#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 151343#true] [2018-07-23 13:38:01,492 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:01,492 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:38:01,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:38:01,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:38:01,493 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-07-23 13:38:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:03,254 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-07-23 13:38:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:38:03,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:38:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:03,256 INFO L225 Difference]: With dead ends: 1420 [2018-07-23 13:38:03,257 INFO L226 Difference]: Without dead ends: 1412 [2018-07-23 13:38:03,257 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:38:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-07-23 13:38:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-07-23 13:38:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-07-23 13:38:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-07-23 13:38:04,370 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-07-23 13:38:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:04,370 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-07-23 13:38:04,371 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:38:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-07-23 13:38:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:38:04,371 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:04,371 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:04,371 INFO L414 AbstractCegarLoop]: === Iteration 45 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-07-23 13:38:04,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:04,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:04,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:38:04,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:04,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:38:04,381 INFO L185 omatonBuilderFactory]: Interpolants [156162#false, 156163#(= product__local__threadpooling_end_1 product__global_next), 156161#true, 156166#(< product__local__threadpooling_working_1 product__local__threadpooling_begin_0), 156167#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 156164#(< product__local__threadpooling_i_1 product__global_next), 156165#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 156168#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 156169#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0)] [2018-07-23 13:38:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:04,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:38:04,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:38:04,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:38:04,381 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 9 states. [2018-07-23 13:38:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:06,325 INFO L93 Difference]: Finished difference Result 1426 states and 3132 transitions. [2018-07-23 13:38:06,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:38:06,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:38:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:06,327 INFO L225 Difference]: With dead ends: 1426 [2018-07-23 13:38:06,327 INFO L226 Difference]: Without dead ends: 1418 [2018-07-23 13:38:06,328 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:38:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-07-23 13:38:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 956. [2018-07-23 13:38:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2018-07-23 13:38:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2159 transitions. [2018-07-23 13:38:07,525 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2159 transitions. Word has length 16 [2018-07-23 13:38:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:07,525 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 2159 transitions. [2018-07-23 13:38:07,525 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:38:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2159 transitions. [2018-07-23 13:38:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:38:07,526 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:07,526 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:07,526 INFO L414 AbstractCegarLoop]: === Iteration 46 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:07,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-07-23 13:38:07,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:07,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:07,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:38:07,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:07,535 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:07,536 INFO L185 omatonBuilderFactory]: Interpolants [160994#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 160995#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 160992#(< product__local__threadpooling_working_1 product__global_next), 160993#(< product__local__threadpooling_working_1 product__local__threadpooling_begin_0), 160996#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0), 160990#(= product__local__threadpooling_end_1 product__global_next), 160991#(< product__local__threadpooling_i_1 product__global_next), 160988#true, 160989#false] [2018-07-23 13:38:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:07,536 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:38:07,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:38:07,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:38:07,537 INFO L87 Difference]: Start difference. First operand 956 states and 2159 transitions. Second operand 9 states. [2018-07-23 13:38:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:09,043 INFO L93 Difference]: Finished difference Result 1172 states and 2569 transitions. [2018-07-23 13:38:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:38:09,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:38:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:09,045 INFO L225 Difference]: With dead ends: 1172 [2018-07-23 13:38:09,046 INFO L226 Difference]: Without dead ends: 1164 [2018-07-23 13:38:09,046 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:38:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-07-23 13:38:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 856. [2018-07-23 13:38:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-23 13:38:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1928 transitions. [2018-07-23 13:38:10,022 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1928 transitions. Word has length 16 [2018-07-23 13:38:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:10,022 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1928 transitions. [2018-07-23 13:38:10,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:38:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1928 transitions. [2018-07-23 13:38:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:38:10,023 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:10,023 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:10,023 INFO L414 AbstractCegarLoop]: === Iteration 47 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:10,023 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-07-23 13:38:10,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:10,033 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:10,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:38:10,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:10,034 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:10,034 INFO L185 omatonBuilderFactory]: Interpolants [165104#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_i_0), 165105#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_working_0), 165098#true, 165099#false, 165102#(< (+ product__local__threadpooling_working_1 1.0) product__global_next), 165103#(< (+ product__local__threadpooling_working_1 1.0) product__local__threadpooling_begin_0), 165100#(< (+ product__local__threadpooling_working_1 1.0) (+ product__global_next (* 2.0 product__global_workload))), 165101#(< (+ product__local__threadpooling_working_1 1.0) (+ product__global_next product__global_workload))] [2018-07-23 13:38:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:10,035 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:10,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:10,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:10,035 INFO L87 Difference]: Start difference. First operand 856 states and 1928 transitions. Second operand 8 states. [2018-07-23 13:38:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:11,742 INFO L93 Difference]: Finished difference Result 1295 states and 2858 transitions. [2018-07-23 13:38:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:38:11,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-07-23 13:38:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:11,743 INFO L225 Difference]: With dead ends: 1295 [2018-07-23 13:38:11,743 INFO L226 Difference]: Without dead ends: 1290 [2018-07-23 13:38:11,744 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:38:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-07-23 13:38:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1017. [2018-07-23 13:38:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2018-07-23 13:38:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 2270 transitions. [2018-07-23 13:38:12,968 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 2270 transitions. Word has length 17 [2018-07-23 13:38:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:12,968 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 2270 transitions. [2018-07-23 13:38:12,968 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 2270 transitions. [2018-07-23 13:38:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:38:12,969 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:12,969 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:12,969 INFO L414 AbstractCegarLoop]: === Iteration 48 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-07-23 13:38:12,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,984 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:12,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:12,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:12,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:38:12,985 INFO L185 omatonBuilderFactory]: Interpolants [169760#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 169750#true, 169751#false, 169754#(and (< product__local__threadpooling_i_1 (+ product__local__threadpooling_end_1 product__global_workload)) (= product__local__threadpooling_end_1 product__global_next)), 169755#(and (= product__local__threadpooling_end_1 product__global_next) (< product__local__threadpooling_working_1 (+ product__local__threadpooling_end_1 product__global_workload))), 169752#(< 0.0 product__global_workload), 169753#(and (= product__local__threadpooling_end_1 product__global_next) (< 0.0 product__global_workload)), 169758#(not (= product__local__threadpooling_working_1 product__local__threadpooling_begin_0)), 169759#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 169756#(< product__local__threadpooling_working_1 (+ product__global_next product__global_workload)), 169757#(not (= product__local__threadpooling_working_1 product__global_next))] [2018-07-23 13:38:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,986 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:12,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:12,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:12,986 INFO L87 Difference]: Start difference. First operand 1017 states and 2270 transitions. Second operand 11 states. [2018-07-23 13:38:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:15,501 INFO L93 Difference]: Finished difference Result 1730 states and 3766 transitions. [2018-07-23 13:38:15,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:38:15,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-07-23 13:38:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:15,503 INFO L225 Difference]: With dead ends: 1730 [2018-07-23 13:38:15,503 INFO L226 Difference]: Without dead ends: 1722 [2018-07-23 13:38:15,504 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:38:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2018-07-23 13:38:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1463. [2018-07-23 13:38:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2018-07-23 13:38:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 3272 transitions. [2018-07-23 13:38:17,299 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 3272 transitions. Word has length 17 [2018-07-23 13:38:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:17,299 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 3272 transitions. [2018-07-23 13:38:17,299 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 3272 transitions. [2018-07-23 13:38:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:17,301 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:17,301 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:17,301 INFO L414 AbstractCegarLoop]: === Iteration 49 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-07-23 13:38:17,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:17,317 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:17,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:17,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:17,317 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,317 INFO L185 omatonBuilderFactory]: Interpolants [176210#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 176208#(< product__local__threadpooling_end_1 product__local__threadpooling_working_0), 176209#(< product__local__threadpooling_i_1 product__local__threadpooling_working_0), 176199#true, 176202#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_1 product__local__threadpooling_begin_0)), 176203#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 176200#false, 176201#(= product__local__threadpooling_end_1 product__global_next), 176206#(< product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 176207#(< product__local__threadpooling_end_1 product__local__threadpooling_i_0), 176204#(and (< product__local__threadpooling_i_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 176205#(< product__local__threadpooling_end_1 product__global_next)] [2018-07-23 13:38:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:17,318 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:17,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:17,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:17,318 INFO L87 Difference]: Start difference. First operand 1463 states and 3272 transitions. Second operand 12 states. [2018-07-23 13:38:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:20,710 INFO L93 Difference]: Finished difference Result 2244 states and 4948 transitions. [2018-07-23 13:38:20,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:38:20,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:20,713 INFO L225 Difference]: With dead ends: 2244 [2018-07-23 13:38:20,713 INFO L226 Difference]: Without dead ends: 2236 [2018-07-23 13:38:20,714 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:38:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2018-07-23 13:38:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1750. [2018-07-23 13:38:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-07-23 13:38:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3957 transitions. [2018-07-23 13:38:22,720 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3957 transitions. Word has length 20 [2018-07-23 13:38:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:22,721 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 3957 transitions. [2018-07-23 13:38:22,721 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3957 transitions. [2018-07-23 13:38:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:22,722 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:22,722 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:22,722 INFO L414 AbstractCegarLoop]: === Iteration 50 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:22,722 INFO L82 PathProgramCache]: Analyzing trace with hash -408643838, now seen corresponding path program 1 times [2018-07-23 13:38:22,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:22,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:22,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:22,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:22,734 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:22,734 INFO L185 omatonBuilderFactory]: Interpolants [184258#(< product__local__threadpooling_end_1 product__local__threadpooling_i_0), 184259#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 184256#(< product__local__threadpooling_end_1 product__global_next), 184257#(< product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 184260#(< product__local__threadpooling_i_1 product__local__threadpooling_working_0), 184261#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 184250#true, 184251#false, 184254#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 184255#(and (< product__local__threadpooling_i_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 184252#(= product__local__threadpooling_end_1 product__global_next), 184253#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_1 product__local__threadpooling_begin_0))] [2018-07-23 13:38:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:22,734 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:22,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:22,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:22,735 INFO L87 Difference]: Start difference. First operand 1750 states and 3957 transitions. Second operand 12 states. [2018-07-23 13:38:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:26,182 INFO L93 Difference]: Finished difference Result 2632 states and 5780 transitions. [2018-07-23 13:38:26,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:38:26,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:26,186 INFO L225 Difference]: With dead ends: 2632 [2018-07-23 13:38:26,186 INFO L226 Difference]: Without dead ends: 2624 [2018-07-23 13:38:26,187 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:38:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2018-07-23 13:38:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1762. [2018-07-23 13:38:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2018-07-23 13:38:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 3981 transitions. [2018-07-23 13:38:28,173 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 3981 transitions. Word has length 20 [2018-07-23 13:38:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:28,173 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 3981 transitions. [2018-07-23 13:38:28,173 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 3981 transitions. [2018-07-23 13:38:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:28,175 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:28,175 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:28,175 INFO L414 AbstractCegarLoop]: === Iteration 51 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:28,175 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-07-23 13:38:28,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:28,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:28,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:28,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:28,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:28,190 INFO L185 omatonBuilderFactory]: Interpolants [193122#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 193123#(and (< product__local__threadpooling_i_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 193120#(= product__local__threadpooling_end_1 product__global_next), 193121#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_1 product__local__threadpooling_begin_0)), 193126#(< product__local__threadpooling_end_1 product__local__threadpooling_i_0), 193127#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 193124#(< product__local__threadpooling_end_1 product__global_next), 193125#(< product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 193128#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 193129#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 193118#true, 193119#false] [2018-07-23 13:38:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:28,191 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:28,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:28,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:28,191 INFO L87 Difference]: Start difference. First operand 1762 states and 3981 transitions. Second operand 12 states. [2018-07-23 13:38:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:32,079 INFO L93 Difference]: Finished difference Result 2682 states and 5922 transitions. [2018-07-23 13:38:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:38:32,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:32,082 INFO L225 Difference]: With dead ends: 2682 [2018-07-23 13:38:32,082 INFO L226 Difference]: Without dead ends: 2674 [2018-07-23 13:38:32,084 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:38:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2018-07-23 13:38:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1808. [2018-07-23 13:38:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-07-23 13:38:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 4093 transitions. [2018-07-23 13:38:34,219 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 4093 transitions. Word has length 20 [2018-07-23 13:38:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:34,219 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 4093 transitions. [2018-07-23 13:38:34,219 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 4093 transitions. [2018-07-23 13:38:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:34,220 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:34,221 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:34,221 INFO L414 AbstractCegarLoop]: === Iteration 52 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash 822945893, now seen corresponding path program 1 times [2018-07-23 13:38:34,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:34,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:34,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:34,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:38:34,234 INFO L185 omatonBuilderFactory]: Interpolants [202195#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_1 product__local__threadpooling_begin_0)), 202194#(= product__local__threadpooling_end_1 product__global_next), 202193#false, 202192#true, 202199#(< product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 202198#(< product__local__threadpooling_end_1 product__global_next), 202197#(and (< product__local__threadpooling_i_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 202196#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 202203#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 202202#(< product__local__threadpooling_i_1 product__local__threadpooling_working_0), 202201#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 202200#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0)] [2018-07-23 13:38:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,234 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:34,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:34,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:34,235 INFO L87 Difference]: Start difference. First operand 1808 states and 4093 transitions. Second operand 12 states. [2018-07-23 13:38:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:37,923 INFO L93 Difference]: Finished difference Result 2725 states and 5993 transitions. [2018-07-23 13:38:37,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:38:37,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:37,927 INFO L225 Difference]: With dead ends: 2725 [2018-07-23 13:38:37,927 INFO L226 Difference]: Without dead ends: 2717 [2018-07-23 13:38:37,928 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=344, Invalid=1548, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:38:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2018-07-23 13:38:40,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 1923. [2018-07-23 13:38:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2018-07-23 13:38:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 4343 transitions. [2018-07-23 13:38:40,135 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 4343 transitions. Word has length 20 [2018-07-23 13:38:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:40,136 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 4343 transitions. [2018-07-23 13:38:40,136 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 4343 transitions. [2018-07-23 13:38:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:40,137 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:40,137 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:40,137 INFO L414 AbstractCegarLoop]: === Iteration 53 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash 822946172, now seen corresponding path program 1 times [2018-07-23 13:38:40,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:40,150 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:40,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:40,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:40,150 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:40,151 INFO L185 omatonBuilderFactory]: Interpolants [211571#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 211570#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_1 product__local__threadpooling_begin_0)), 211569#(= product__local__threadpooling_end_1 product__global_next), 211568#false, 211575#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 211574#(< product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 211573#(< product__local__threadpooling_end_1 product__global_next), 211572#(and (< product__local__threadpooling_i_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 211578#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 211577#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 211576#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 211567#true] [2018-07-23 13:38:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:40,151 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:40,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:40,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:40,152 INFO L87 Difference]: Start difference. First operand 1923 states and 4343 transitions. Second operand 12 states. [2018-07-23 13:38:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:44,683 INFO L93 Difference]: Finished difference Result 2981 states and 6573 transitions. [2018-07-23 13:38:44,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:38:44,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:44,686 INFO L225 Difference]: With dead ends: 2981 [2018-07-23 13:38:44,686 INFO L226 Difference]: Without dead ends: 2973 [2018-07-23 13:38:44,687 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:38:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2018-07-23 13:38:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1885. [2018-07-23 13:38:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2018-07-23 13:38:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 4258 transitions. [2018-07-23 13:38:46,870 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 4258 transitions. Word has length 20 [2018-07-23 13:38:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:46,870 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 4258 transitions. [2018-07-23 13:38:46,870 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 4258 transitions. [2018-07-23 13:38:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:46,871 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:46,871 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:46,872 INFO L414 AbstractCegarLoop]: === Iteration 54 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 826825729, now seen corresponding path program 1 times [2018-07-23 13:38:46,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:46,881 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:46,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:46,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:46,882 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,882 INFO L185 omatonBuilderFactory]: Interpolants [221411#(and (< product__local__threadpooling_i_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 221410#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)), 221409#(and (<= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_1 product__local__threadpooling_begin_0)), 221408#(= product__local__threadpooling_end_1 product__global_next), 221415#(< product__local__threadpooling_working_1 product__local__threadpooling_begin_0), 221414#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 221413#(< product__local__threadpooling_end_1 product__local__threadpooling_begin_0), 221412#(< product__local__threadpooling_end_1 product__global_next), 221417#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 221416#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 221407#false, 221406#true] [2018-07-23 13:38:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:46,882 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:46,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:46,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:46,882 INFO L87 Difference]: Start difference. First operand 1885 states and 4258 transitions. Second operand 12 states. [2018-07-23 13:38:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:50,990 INFO L93 Difference]: Finished difference Result 2756 states and 6082 transitions. [2018-07-23 13:38:50,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:38:50,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 13:38:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:50,993 INFO L225 Difference]: With dead ends: 2756 [2018-07-23 13:38:50,993 INFO L226 Difference]: Without dead ends: 2748 [2018-07-23 13:38:50,993 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=456, Invalid=2406, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:38:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2018-07-23 13:38:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2013. [2018-07-23 13:38:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2018-07-23 13:38:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 4552 transitions. [2018-07-23 13:38:53,434 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 4552 transitions. Word has length 20 [2018-07-23 13:38:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:53,434 INFO L471 AbstractCegarLoop]: Abstraction has 2013 states and 4552 transitions. [2018-07-23 13:38:53,434 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 4552 transitions. [2018-07-23 13:38:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:53,435 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:53,435 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:53,435 INFO L414 AbstractCegarLoop]: === Iteration 55 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash 89905005, now seen corresponding path program 1 times [2018-07-23 13:38:53,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:53,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:53,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:53,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:53,447 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:53,447 INFO L185 omatonBuilderFactory]: Interpolants [231047#false, 231046#true, 231051#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__global_next product__local__threadpooling_i_0)), 231050#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__global_next product__local__threadpooling_begin_0)), 231049#(< product__local__threadpooling_i_1 product__global_next), 231048#(= product__local__threadpooling_end_1 product__global_next), 231055#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 231054#(< product__local__threadpooling_i_1 product__local__threadpooling_working_0), 231053#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 231052#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0)] [2018-07-23 13:38:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:53,447 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:38:53,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:38:53,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:38:53,448 INFO L87 Difference]: Start difference. First operand 2013 states and 4552 transitions. Second operand 10 states. [2018-07-23 13:38:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:56,615 INFO L93 Difference]: Finished difference Result 2560 states and 5727 transitions. [2018-07-23 13:38:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:38:56,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-07-23 13:38:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:56,617 INFO L225 Difference]: With dead ends: 2560 [2018-07-23 13:38:56,617 INFO L226 Difference]: Without dead ends: 2552 [2018-07-23 13:38:56,618 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:38:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-07-23 13:38:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2037. [2018-07-23 13:38:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-07-23 13:38:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 4589 transitions. [2018-07-23 13:38:59,086 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 4589 transitions. Word has length 20 [2018-07-23 13:38:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:59,086 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 4589 transitions. [2018-07-23 13:38:59,086 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:38:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 4589 transitions. [2018-07-23 13:38:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:38:59,088 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:59,088 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:59,088 INFO L414 AbstractCegarLoop]: === Iteration 56 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:38:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash 89905284, now seen corresponding path program 1 times [2018-07-23 13:38:59,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:59,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:59,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:38:59,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:59,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:38:59,099 INFO L185 omatonBuilderFactory]: Interpolants [240289#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 240288#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 240283#(< product__local__threadpooling_i_1 product__global_next), 240282#(= product__local__threadpooling_end_1 product__global_next), 240281#false, 240280#true, 240287#(< product__local__threadpooling_i_1 product__local__threadpooling_i_0), 240286#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 240285#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__global_next product__local__threadpooling_i_0)), 240284#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__local__threadpooling_begin_0 product__global_next))] [2018-07-23 13:38:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:59,100 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:38:59,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:38:59,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:38:59,100 INFO L87 Difference]: Start difference. First operand 2037 states and 4589 transitions. Second operand 10 states. [2018-07-23 13:39:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:03,192 INFO L93 Difference]: Finished difference Result 2954 states and 6607 transitions. [2018-07-23 13:39:03,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:39:03,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-07-23 13:39:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:03,196 INFO L225 Difference]: With dead ends: 2954 [2018-07-23 13:39:03,196 INFO L226 Difference]: Without dead ends: 2946 [2018-07-23 13:39:03,197 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:39:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2018-07-23 13:39:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2097. [2018-07-23 13:39:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2018-07-23 13:39:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 4733 transitions. [2018-07-23 13:39:05,729 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 4733 transitions. Word has length 20 [2018-07-23 13:39:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:05,730 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 4733 transitions. [2018-07-23 13:39:05,730 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:39:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 4733 transitions. [2018-07-23 13:39:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:39:05,732 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:05,732 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:05,732 INFO L414 AbstractCegarLoop]: === Iteration 57 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:05,732 INFO L82 PathProgramCache]: Analyzing trace with hash 93784841, now seen corresponding path program 1 times [2018-07-23 13:39:05,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:05,743 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:05,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:05,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:05,744 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:05,744 INFO L185 omatonBuilderFactory]: Interpolants [250439#(= product__local__threadpooling_end_1 product__global_next), 250438#false, 250437#true, 250443#(< product__local__threadpooling_i_1 product__local__threadpooling_begin_0), 250442#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__global_next product__local__threadpooling_i_0)), 250441#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__local__threadpooling_begin_0 product__global_next)), 250440#(< product__local__threadpooling_i_1 product__global_next), 250446#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 250445#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 250444#(< product__local__threadpooling_working_1 product__local__threadpooling_begin_0)] [2018-07-23 13:39:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:05,744 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:39:05,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:39:05,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:39:05,745 INFO L87 Difference]: Start difference. First operand 2097 states and 4733 transitions. Second operand 10 states. [2018-07-23 13:39:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:09,546 INFO L93 Difference]: Finished difference Result 2943 states and 6561 transitions. [2018-07-23 13:39:09,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:39:09,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-07-23 13:39:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:09,550 INFO L225 Difference]: With dead ends: 2943 [2018-07-23 13:39:09,550 INFO L226 Difference]: Without dead ends: 2935 [2018-07-23 13:39:09,551 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:39:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2018-07-23 13:39:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2113. [2018-07-23 13:39:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-07-23 13:39:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 4769 transitions. [2018-07-23 13:39:12,102 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 4769 transitions. Word has length 20 [2018-07-23 13:39:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:12,102 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 4769 transitions. [2018-07-23 13:39:12,102 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:39:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 4769 transitions. [2018-07-23 13:39:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:39:12,103 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:12,103 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:12,104 INFO L414 AbstractCegarLoop]: === Iteration 58 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash 183366378, now seen corresponding path program 1 times [2018-07-23 13:39:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:12,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:12,113 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:12,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:12,113 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:12,113 INFO L185 omatonBuilderFactory]: Interpolants [260627#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 260626#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 260625#(< product__local__threadpooling_working_1 product__local__threadpooling_begin_0), 260624#(< product__local__threadpooling_working_1 product__global_next), 260619#false, 260618#true, 260623#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__global_next product__local__threadpooling_i_0)), 260622#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__global_next product__local__threadpooling_begin_0)), 260621#(< product__local__threadpooling_i_1 product__global_next), 260620#(= product__local__threadpooling_end_1 product__global_next)] [2018-07-23 13:39:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:39:12,114 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:39:12,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:39:12,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:39:12,114 INFO L87 Difference]: Start difference. First operand 2113 states and 4769 transitions. Second operand 10 states. [2018-07-23 13:39:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:16,098 INFO L93 Difference]: Finished difference Result 3095 states and 6879 transitions. [2018-07-23 13:39:16,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:39:16,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-07-23 13:39:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:16,102 INFO L225 Difference]: With dead ends: 3095 [2018-07-23 13:39:16,102 INFO L226 Difference]: Without dead ends: 3087 [2018-07-23 13:39:16,103 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:39:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2018-07-23 13:39:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2233. [2018-07-23 13:39:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2018-07-23 13:39:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 5055 transitions. [2018-07-23 13:39:18,803 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 5055 transitions. Word has length 20 [2018-07-23 13:39:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 2233 states and 5055 transitions. [2018-07-23 13:39:18,803 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:39:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 5055 transitions. [2018-07-23 13:39:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:39:18,805 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:18,805 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:18,805 INFO L414 AbstractCegarLoop]: === Iteration 59 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:18,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1435011527, now seen corresponding path program 1 times [2018-07-23 13:39:18,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:18,814 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:18,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:39:18,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:18,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:39:18,814 INFO L185 omatonBuilderFactory]: Interpolants [271348#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__global_next product__local__threadpooling_begin_0)), 271349#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__global_next product__local__threadpooling_i_0)), 271350#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_working_1) (+ product__global_next product__local__threadpooling_i_0)), 271351#(< product__local__threadpooling_working_1 product__global_next), 271344#true, 271345#false, 271346#(= product__local__threadpooling_end_1 product__global_next), 271347#(< product__local__threadpooling_i_1 product__global_next), 271352#(< product__local__threadpooling_working_1 product__local__threadpooling_begin_0), 271353#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 271354#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0)] [2018-07-23 13:39:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:18,814 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:39:18,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:39:18,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:39:18,815 INFO L87 Difference]: Start difference. First operand 2233 states and 5055 transitions. Second operand 11 states. [2018-07-23 13:39:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:23,551 INFO L93 Difference]: Finished difference Result 3570 states and 7977 transitions. [2018-07-23 13:39:23,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:39:23,551 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 13:39:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:23,556 INFO L225 Difference]: With dead ends: 3570 [2018-07-23 13:39:23,556 INFO L226 Difference]: Without dead ends: 3562 [2018-07-23 13:39:23,557 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:39:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2018-07-23 13:39:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 2257. [2018-07-23 13:39:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2018-07-23 13:39:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 5109 transitions. [2018-07-23 13:39:26,366 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 5109 transitions. Word has length 20 [2018-07-23 13:39:26,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:26,366 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 5109 transitions. [2018-07-23 13:39:26,366 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:39:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 5109 transitions. [2018-07-23 13:39:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:39:26,367 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:26,367 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:26,367 INFO L414 AbstractCegarLoop]: === Iteration 60 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:26,367 INFO L82 PathProgramCache]: Analyzing trace with hash 777730375, now seen corresponding path program 1 times [2018-07-23 13:39:26,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:26,379 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:26,379 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:39:26,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:26,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:39:26,380 INFO L185 omatonBuilderFactory]: Interpolants [283079#true, 283088#(< product__local__threadpooling_working_1 product__local__threadpooling_i_0), 283089#(< product__local__threadpooling_working_1 product__local__threadpooling_working_0), 283084#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_working_1) (+ product__local__threadpooling_begin_0 product__global_next)), 283085#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_working_1) (+ product__global_next product__local__threadpooling_i_0)), 283086#(< product__local__threadpooling_working_1 product__global_next), 283087#(< product__local__threadpooling_working_1 product__local__threadpooling_begin_0), 283080#false, 283081#(= product__local__threadpooling_end_1 product__global_next), 283082#(< product__local__threadpooling_i_1 product__global_next), 283083#(< (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1) (+ product__local__threadpooling_begin_0 product__global_next))] [2018-07-23 13:39:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:26,380 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:39:26,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:39:26,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:39:26,381 INFO L87 Difference]: Start difference. First operand 2257 states and 5109 transitions. Second operand 11 states. [2018-07-23 13:39:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:30,431 INFO L93 Difference]: Finished difference Result 2941 states and 6541 transitions. [2018-07-23 13:39:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:39:30,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 13:39:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:30,435 INFO L225 Difference]: With dead ends: 2941 [2018-07-23 13:39:30,435 INFO L226 Difference]: Without dead ends: 2933 [2018-07-23 13:39:30,436 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:39:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2018-07-23 13:39:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2372. [2018-07-23 13:39:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2372 states. [2018-07-23 13:39:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 5350 transitions. [2018-07-23 13:39:33,429 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 5350 transitions. Word has length 20 [2018-07-23 13:39:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 2372 states and 5350 transitions. [2018-07-23 13:39:33,429 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:39:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 5350 transitions. [2018-07-23 13:39:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:33,431 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:33,431 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:33,431 INFO L414 AbstractCegarLoop]: === Iteration 61 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash 371911669, now seen corresponding path program 1 times [2018-07-23 13:39:33,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:33,441 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:33,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:39:33,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:33,442 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:33,442 INFO L185 omatonBuilderFactory]: Interpolants [293780#(<= (+ (* 2.0 product__local__threadpooling_end_0) 1.0) (+ product__global_next product__local__threadpooling_i_0 product__global_workload)), 293781#(< (+ product__local__threadpooling_i_0 1.0) (+ product__global_next product__global_workload)), 293782#(< (+ product__local__threadpooling_working_0 1.0) (+ product__global_next product__global_workload)), 293783#(not (= product__local__threadpooling_working_0 product__global_next)), 293776#true, 293777#false, 293778#(<= (* 2.0 product__local__threadpooling_end_0) (+ product__global_next product__local__threadpooling_begin_0 product__global_workload)), 293779#(<= (* 2.0 product__local__threadpooling_end_0) (+ product__global_next product__local__threadpooling_i_0 product__global_workload)), 293784#(not (= product__local__threadpooling_working_0 product__local__threadpooling_begin_1)), 293785#(not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)), 293786#(not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))] [2018-07-23 13:39:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:33,442 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:39:33,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:39:33,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:39:33,443 INFO L87 Difference]: Start difference. First operand 2372 states and 5350 transitions. Second operand 11 states. [2018-07-23 13:39:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:38,234 INFO L93 Difference]: Finished difference Result 3102 states and 6851 transitions. [2018-07-23 13:39:38,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:39:38,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-07-23 13:39:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:38,238 INFO L225 Difference]: With dead ends: 3102 [2018-07-23 13:39:38,239 INFO L226 Difference]: Without dead ends: 3094 [2018-07-23 13:39:38,239 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:39:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2018-07-23 13:39:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2548. [2018-07-23 13:39:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-07-23 13:39:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 5732 transitions. [2018-07-23 13:39:41,572 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 5732 transitions. Word has length 21 [2018-07-23 13:39:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:41,572 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 5732 transitions. [2018-07-23 13:39:41,572 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:39:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 5732 transitions. [2018-07-23 13:39:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:41,573 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:41,573 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:41,573 INFO L414 AbstractCegarLoop]: === Iteration 62 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash -377266403, now seen corresponding path program 1 times [2018-07-23 13:39:41,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:41,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:41,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:41,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:41,582 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:41,582 INFO L185 omatonBuilderFactory]: Interpolants [305157#true, 305158#false, 305159#(<= (+ product__local__threadpooling_begin_1 product__global_workload) product__local__threadpooling_end_1), 305164#(<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1.0)), 305165#(<= product__local__threadpooling_end_0 product__local__threadpooling_i_0), 305160#(<= (+ product__local__threadpooling_i_1 product__global_workload) product__local__threadpooling_end_1), 305161#(<= (+ product__local__threadpooling_i_1 product__global_workload) (+ product__local__threadpooling_end_1 1.0)), 305162#(<= product__global_workload 1.0), 305163#(<= product__local__threadpooling_end_0 (+ product__local__threadpooling_begin_0 1.0))] [2018-07-23 13:39:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:41,583 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:41,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:41,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:41,583 INFO L87 Difference]: Start difference. First operand 2548 states and 5732 transitions. Second operand 9 states. [2018-07-23 13:39:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:51,460 INFO L93 Difference]: Finished difference Result 9530 states and 21497 transitions. [2018-07-23 13:39:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:39:51,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-07-23 13:39:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:51,470 INFO L225 Difference]: With dead ends: 9530 [2018-07-23 13:39:51,471 INFO L226 Difference]: Without dead ends: 7258 [2018-07-23 13:39:51,476 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:39:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2018-07-23 13:39:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 5099. [2018-07-23 13:39:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5099 states. [2018-07-23 13:39:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 11597 transitions. [2018-07-23 13:39:58,483 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 11597 transitions. Word has length 21 [2018-07-23 13:39:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:58,484 INFO L471 AbstractCegarLoop]: Abstraction has 5099 states and 11597 transitions. [2018-07-23 13:39:58,484 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:39:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 11597 transitions. [2018-07-23 13:39:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:39:58,486 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:58,486 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:58,486 INFO L414 AbstractCegarLoop]: === Iteration 63 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:39:58,487 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-07-23 13:39:58,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:58,495 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:58,495 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:39:58,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:58,495 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:58,495 INFO L185 omatonBuilderFactory]: Interpolants [334471#true, 334477#(< (+ product__local__threadpooling_begin_1 1.0) product__local__threadpooling_end_1), 334476#(<= (+ product__local__threadpooling_end_0 product__local__threadpooling_begin_1 1.0) (+ product__local__threadpooling_end_1 product__local__threadpooling_i_0)), 334479#(< product__local__threadpooling_i_1 product__local__threadpooling_end_1), 334478#(< (+ product__local__threadpooling_i_1 1.0) product__local__threadpooling_end_1), 334473#(<= product__local__threadpooling_end_0 (+ product__local__threadpooling_begin_0 product__global_workload)), 334472#false, 334475#(<= (+ product__local__threadpooling_end_0 product__local__threadpooling_begin_1) (+ product__local__threadpooling_end_1 product__local__threadpooling_i_0)), 334474#(<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 product__global_workload))] [2018-07-23 13:39:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:58,496 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:39:58,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:39:58,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:39:58,496 INFO L87 Difference]: Start difference. First operand 5099 states and 11597 transitions. Second operand 9 states. [2018-07-23 13:40:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:13,891 INFO L93 Difference]: Finished difference Result 13824 states and 31502 transitions. [2018-07-23 13:40:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:40:13,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-07-23 13:40:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:13,906 INFO L225 Difference]: With dead ends: 13824 [2018-07-23 13:40:13,906 INFO L226 Difference]: Without dead ends: 12174 [2018-07-23 13:40:13,911 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:40:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12174 states. [2018-07-23 13:40:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12174 to 7081. [2018-07-23 13:40:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7081 states. [2018-07-23 13:40:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15893 transitions. [2018-07-23 13:40:23,407 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15893 transitions. Word has length 24 [2018-07-23 13:40:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:23,407 INFO L471 AbstractCegarLoop]: Abstraction has 7081 states and 15893 transitions. [2018-07-23 13:40:23,407 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:40:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15893 transitions. [2018-07-23 13:40:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:40:23,410 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:23,410 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:23,410 INFO L414 AbstractCegarLoop]: === Iteration 64 === [productErr5AssertViolationASSERT, productErr12AssertViolationASSERT, productErr8AssertViolationASSERT, productErr7AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr10AssertViolationASSERT, productErr2AssertViolationASSERT, productErr9AssertViolationASSERT, productErr6AssertViolationASSERT, productErr3AssertViolationASSERT, productErr13AssertViolationASSERT, productErr1AssertViolationASSERT, productErr11AssertViolationASSERT]=== [2018-07-23 13:40:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1269424552, now seen corresponding path program 1 times [2018-07-23 13:40:23,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:23,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:23,421 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:40:23,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:23,421 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:23,422 INFO L185 omatonBuilderFactory]: Interpolants [376327#false, 376326#true, 376333#(< (+ product__local__threadpooling_i_1 1.0) product__local__threadpooling_end_1), 376332#(<= (+ product__local__threadpooling_end_0 product__local__threadpooling_i_1 1.0) (+ product__local__threadpooling_end_1 product__local__threadpooling_i_0)), 376334#(< product__local__threadpooling_i_1 product__local__threadpooling_end_1), 376329#(<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 product__global_workload)), 376328#(<= product__local__threadpooling_end_0 (+ product__local__threadpooling_begin_0 product__global_workload)), 376331#(<= (+ product__local__threadpooling_end_0 product__local__threadpooling_begin_1 1.0) (+ product__local__threadpooling_end_1 product__local__threadpooling_i_0)), 376330#(<= (+ product__local__threadpooling_end_0 product__local__threadpooling_begin_1) (+ product__local__threadpooling_end_1 product__local__threadpooling_i_0))] [2018-07-23 13:40:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:23,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:40:23,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:40:23,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:40:23,423 INFO L87 Difference]: Start difference. First operand 7081 states and 15893 transitions. Second operand 9 states. [2018-07-23 13:40:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:38,928 INFO L93 Difference]: Finished difference Result 14557 states and 32575 transitions. [2018-07-23 13:40:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:40:38,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-07-23 13:40:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:38,940 INFO L225 Difference]: With dead ends: 14557 [2018-07-23 13:40:38,941 INFO L226 Difference]: Without dead ends: 12252 [2018-07-23 13:40:38,946 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:40:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12252 states. Received shutdown request... [2018-07-23 13:40:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12252 to 7165. [2018-07-23 13:40:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7165 states. [2018-07-23 13:40:49,113 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:40:49,119 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:40:49,119 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:40:49 BoogieIcfgContainer [2018-07-23 13:40:49,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:40:49,121 INFO L168 Benchmark]: Toolchain (without parser) took 252324.52 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 230.6 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 13:40:49,122 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:49,123 INFO L168 Benchmark]: Boogie Preprocessor took 101.52 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:49,123 INFO L168 Benchmark]: RCFGBuilder took 356.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:40:49,124 INFO L168 Benchmark]: TraceAbstraction took 251861.78 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 220.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 13:40:49,126 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 101.52 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 356.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251861.78 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 220.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 251.7s OverallTime, 64 OverallIterations, 2 TraceHistogramMax, 160.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17052 SDtfs, 51649 SDslu, 60048 SDs, 0 SdLazy, 122980 SolverSat, 11251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1855 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 1655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11752 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7081occurred in iteration=63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 37/121 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 90.4s AutomataMinimizationTime, 64 MinimizatonAttempts, 38491 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 915 ConstructedInterpolants, 0 QuantifiedInterpolants, 47781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 35 PerfectInterpolantSequences, 37/121 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_out_Reals.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-40-49-137.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-40-49-137.csv Completed graceful shutdown