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_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:36:32,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:36:32,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:36:32,975 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:36:32,976 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:36:32,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:36:32,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:36:32,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:36:32,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:36:32,984 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:36:32,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:36:32,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:36:32,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:36:32,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:36:32,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:36:32,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:36:32,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:36:32,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:36:32,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:36:32,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:36:32,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:36:33,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:36:33,006 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:36:33,006 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:36:33,006 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:36:33,010 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:36:33,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:36:33,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:36:33,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:36:33,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:36:33,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:36:33,022 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:36:33,022 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:36:33,022 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:36:33,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:36:33,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:36:33,027 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:33,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:36:33,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:36:33,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:36:33,051 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:36:33,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:36:33,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:36:33,051 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:36:33,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:36:33,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:36:33,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:36:33,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:36:33,122 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:36:33,123 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:36:33,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl [2018-07-23 13:36:33,124 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-07-23 13:36:33,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:36:33,188 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:36:33,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:36:33,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:36:33,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:36:33,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/1) ... [2018-07-23 13:36:33,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/1) ... [2018-07-23 13:36:33,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/1) ... [2018-07-23 13:36:33,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/1) ... [2018-07-23 13:36:33,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/1) ... [2018-07-23 13:36:33,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/1) ... [2018-07-23 13:36:33,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/1) ... [2018-07-23 13:36:33,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:36:33,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:36:33,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:36:33,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:36:33,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/1) ... [2018-07-23 13:36:33,337 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-23 13:36:33,337 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-23 13:36:33,337 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-23 13:36:33,601 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:36:33,602 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:33 BoogieIcfgContainer [2018-07-23 13:36:33,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:36:33,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:36:33,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:36:33,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:36:33,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:36:33" (1/2) ... [2018-07-23 13:36:33,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2682e280 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:36:33, skipping insertion in model container [2018-07-23 13:36:33,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:36:33" (2/2) ... [2018-07-23 13:36:33,613 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-07-23 13:36:33,623 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:36:33,634 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-07-23 13:36:33,684 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:36:33,684 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:36:33,685 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:36:33,685 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:36:33,685 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:36:33,685 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:36:33,686 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:36:33,686 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:36:33,686 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:36:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-07-23 13:36:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:36:33,711 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:33,713 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:36:33,713 INFO L414 AbstractCegarLoop]: === Iteration 1 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 934086, now seen corresponding path program 1 times [2018-07-23 13:36:33,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:33,821 INFO L134 CoverageAnalysis]: 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:33,824 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:33,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:33,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:33,827 INFO L134 CoverageAnalysis]: 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:33,828 INFO L185 omatonBuilderFactory]: Interpolants [19#true, 20#false, 21#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 22#(<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1), 23#(<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)] [2018-07-23 13:36:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:33,830 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:36:33,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:36:33,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:33,855 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2018-07-23 13:36:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:34,146 INFO L93 Difference]: Finished difference Result 30 states and 67 transitions. [2018-07-23 13:36:34,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:36:34,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:36:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:34,182 INFO L225 Difference]: With dead ends: 30 [2018-07-23 13:36:34,183 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 13:36:34,187 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:36:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 13:36:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-07-23 13:36:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:36:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2018-07-23 13:36:34,235 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 48 transitions. Word has length 4 [2018-07-23 13:36:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:34,236 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 48 transitions. [2018-07-23 13:36:34,236 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:36:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 48 transitions. [2018-07-23 13:36:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:36:34,237 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:34,237 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:36:34,237 INFO L414 AbstractCegarLoop]: === Iteration 2 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1042842, now seen corresponding path program 1 times [2018-07-23 13:36:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:34,281 INFO L134 CoverageAnalysis]: 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:34,281 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:34,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:36:34,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:34,283 INFO L185 omatonBuilderFactory]: Interpolants [132#true, 133#false, 134#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 135#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 136#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:34,287 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:36:34,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:36:34,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:34,288 INFO L87 Difference]: Start difference. First operand 22 states and 48 transitions. Second operand 5 states. [2018-07-23 13:36:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:34,527 INFO L93 Difference]: Finished difference Result 50 states and 117 transitions. [2018-07-23 13:36:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:36:34,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:36:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:34,529 INFO L225 Difference]: With dead ends: 50 [2018-07-23 13:36:34,530 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 13:36:34,532 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 13:36:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-07-23 13:36:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:36:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 101 transitions. [2018-07-23 13:36:34,556 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 101 transitions. Word has length 4 [2018-07-23 13:36:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:34,557 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 101 transitions. [2018-07-23 13:36:34,557 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:36:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 101 transitions. [2018-07-23 13:36:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:34,558 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:34,559 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:34,560 INFO L414 AbstractCegarLoop]: === Iteration 3 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:34,560 INFO L82 PathProgramCache]: Analyzing trace with hash 897580813, now seen corresponding path program 1 times [2018-07-23 13:36:34,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:34,602 INFO L134 CoverageAnalysis]: 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:34,602 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:34,602 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:34,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:34,603 INFO L185 omatonBuilderFactory]: Interpolants [323#true, 324#false, 325#(= product__local__threadpooling_end_1 product__global_next), 326#(= product__local__threadpooling_end_1 product__local__threadpooling_i_0), 327#(= product__local__threadpooling_end_1 product__local__threadpooling_working_0), 328#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:34,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:34,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:34,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:34,607 INFO L87 Difference]: Start difference. First operand 40 states and 101 transitions. Second operand 6 states. [2018-07-23 13:36:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:34,948 INFO L93 Difference]: Finished difference Result 133 states and 334 transitions. [2018-07-23 13:36:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:36:34,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:36:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:34,957 INFO L225 Difference]: With dead ends: 133 [2018-07-23 13:36:34,957 INFO L226 Difference]: Without dead ends: 129 [2018-07-23 13:36:34,958 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:36:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-23 13:36:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 79. [2018-07-23 13:36:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 13:36:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 233 transitions. [2018-07-23 13:36:35,018 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 233 transitions. Word has length 6 [2018-07-23 13:36:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:35,020 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 233 transitions. [2018-07-23 13:36:35,020 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 233 transitions. [2018-07-23 13:36:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:35,021 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:35,022 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:35,024 INFO L414 AbstractCegarLoop]: === Iteration 4 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash 897578023, now seen corresponding path program 1 times [2018-07-23 13:36:35,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,049 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:35,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:35,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,051 INFO L185 omatonBuilderFactory]: Interpolants [768#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 763#true, 764#false, 765#(= product__local__threadpooling_end_1 product__global_next), 766#(= product__local__threadpooling_end_1 product__local__threadpooling_i_0), 767#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))] [2018-07-23 13:36:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,051 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:35,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:35,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:35,053 INFO L87 Difference]: Start difference. First operand 79 states and 233 transitions. Second operand 6 states. [2018-07-23 13:36:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:35,305 INFO L93 Difference]: Finished difference Result 159 states and 405 transitions. [2018-07-23 13:36:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:36:35,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:36:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:35,310 INFO L225 Difference]: With dead ends: 159 [2018-07-23 13:36:35,310 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 13:36:35,313 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:36:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 13:36:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 87. [2018-07-23 13:36:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:36:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 262 transitions. [2018-07-23 13:36:35,341 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 262 transitions. Word has length 6 [2018-07-23 13:36:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:35,341 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 262 transitions. [2018-07-23 13:36:35,342 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 262 transitions. [2018-07-23 13:36:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:35,343 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:35,343 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:35,343 INFO L414 AbstractCegarLoop]: === Iteration 5 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:35,344 INFO L82 PathProgramCache]: Analyzing trace with hash 897664513, now seen corresponding path program 1 times [2018-07-23 13:36:35,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,356 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:35,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:35,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,357 INFO L185 omatonBuilderFactory]: Interpolants [1271#true, 1272#false, 1273#(= product__local__threadpooling_end_1 product__global_next), 1274#(not (= product__local__threadpooling_working_1 product__global_next)), 1275#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 1276#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,358 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:35,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:35,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:35,359 INFO L87 Difference]: Start difference. First operand 87 states and 262 transitions. Second operand 6 states. [2018-07-23 13:36:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:35,560 INFO L93 Difference]: Finished difference Result 171 states and 457 transitions. [2018-07-23 13:36:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:35,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:36:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:35,565 INFO L225 Difference]: With dead ends: 171 [2018-07-23 13:36:35,567 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 13:36:35,568 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:36:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 13:36:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 96. [2018-07-23 13:36:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:36:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 287 transitions. [2018-07-23 13:36:35,617 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 287 transitions. Word has length 6 [2018-07-23 13:36:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:35,617 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 287 transitions. [2018-07-23 13:36:35,617 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 287 transitions. [2018-07-23 13:36:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:35,619 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:35,620 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:35,620 INFO L414 AbstractCegarLoop]: === Iteration 6 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1000032062, now seen corresponding path program 1 times [2018-07-23 13:36:35,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:35,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:36:35,648 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:35,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:35,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,650 INFO L185 omatonBuilderFactory]: Interpolants [1824#false, 1825#(or (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)), 1826#(or (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)), 1827#(not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)), 1828#(not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)), 1823#true] [2018-07-23 13:36:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,651 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:35,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:35,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:35,652 INFO L87 Difference]: Start difference. First operand 96 states and 287 transitions. Second operand 6 states. [2018-07-23 13:36:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:35,902 INFO L93 Difference]: Finished difference Result 221 states and 600 transitions. [2018-07-23 13:36:35,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:35,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:36:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:35,905 INFO L225 Difference]: With dead ends: 221 [2018-07-23 13:36:35,905 INFO L226 Difference]: Without dead ends: 217 [2018-07-23 13:36:35,906 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:36:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-23 13:36:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2018-07-23 13:36:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 13:36:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 395 transitions. [2018-07-23 13:36:35,965 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 395 transitions. Word has length 6 [2018-07-23 13:36:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:35,965 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 395 transitions. [2018-07-23 13:36:35,968 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 395 transitions. [2018-07-23 13:36:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:35,969 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:35,969 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:35,970 INFO L414 AbstractCegarLoop]: === Iteration 7 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1000029272, now seen corresponding path program 1 times [2018-07-23 13:36:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:35,999 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:35,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:36,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,000 INFO L185 omatonBuilderFactory]: Interpolants [2537#true, 2538#false, 2539#(or (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)), 2540#(or (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)), 2541#(or (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)), 2542#(not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))] [2018-07-23 13:36:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:36,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:36,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:36,002 INFO L87 Difference]: Start difference. First operand 127 states and 395 transitions. Second operand 6 states. [2018-07-23 13:36:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:36,238 INFO L93 Difference]: Finished difference Result 225 states and 625 transitions. [2018-07-23 13:36:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:36:36,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:36:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:36,241 INFO L225 Difference]: With dead ends: 225 [2018-07-23 13:36:36,241 INFO L226 Difference]: Without dead ends: 221 [2018-07-23 13:36:36,242 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:36:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-23 13:36:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 133. [2018-07-23 13:36:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 13:36:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 416 transitions. [2018-07-23 13:36:36,293 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 416 transitions. Word has length 6 [2018-07-23 13:36:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:36,293 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 416 transitions. [2018-07-23 13:36:36,294 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 416 transitions. [2018-07-23 13:36:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:36,295 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:36,295 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:36:36,295 INFO L414 AbstractCegarLoop]: === Iteration 8 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1002176124, now seen corresponding path program 1 times [2018-07-23 13:36:36,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,314 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:36,314 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:36:36,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,315 INFO L185 omatonBuilderFactory]: Interpolants [3269#true, 3270#false, 3271#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 3272#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_0), 3273#(<= (+ product__local__threadpooling_working_1 3) product__local__threadpooling_i_0), 3274#(<= (+ product__local__threadpooling_working_1 3) product__local__threadpooling_working_0)] [2018-07-23 13:36:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,319 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:36,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:36,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:36,320 INFO L87 Difference]: Start difference. First operand 133 states and 416 transitions. Second operand 6 states. [2018-07-23 13:36:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:36,471 INFO L93 Difference]: Finished difference Result 156 states and 481 transitions. [2018-07-23 13:36:36,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:36:36,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:36:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:36,474 INFO L225 Difference]: With dead ends: 156 [2018-07-23 13:36:36,474 INFO L226 Difference]: Without dead ends: 154 [2018-07-23 13:36:36,475 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:36:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-23 13:36:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2018-07-23 13:36:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-23 13:36:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 398 transitions. [2018-07-23 13:36:36,533 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 398 transitions. Word has length 6 [2018-07-23 13:36:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:36,534 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 398 transitions. [2018-07-23 13:36:36,534 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 398 transitions. [2018-07-23 13:36:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:36:36,535 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:36,536 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:36:36,536 INFO L414 AbstractCegarLoop]: === Iteration 9 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1002149145, now seen corresponding path program 1 times [2018-07-23 13:36:36,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,556 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:36,556 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:36:36,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,557 INFO L185 omatonBuilderFactory]: Interpolants [3856#(not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)), 3851#true, 3852#false, 3853#(or (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)), 3854#(not (= product__local__threadpooling_working_0 product__global_next)), 3855#(not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))] [2018-07-23 13:36:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,561 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:36:36,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:36:36,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:36:36,562 INFO L87 Difference]: Start difference. First operand 128 states and 398 transitions. Second operand 6 states. [2018-07-23 13:36:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:36,821 INFO L93 Difference]: Finished difference Result 236 states and 666 transitions. [2018-07-23 13:36:36,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:36,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:36:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:36,824 INFO L225 Difference]: With dead ends: 236 [2018-07-23 13:36:36,824 INFO L226 Difference]: Without dead ends: 232 [2018-07-23 13:36:36,825 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-07-23 13:36:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 150. [2018-07-23 13:36:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-23 13:36:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 463 transitions. [2018-07-23 13:36:36,890 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 463 transitions. Word has length 6 [2018-07-23 13:36:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:36,890 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 463 transitions. [2018-07-23 13:36:36,891 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:36:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 463 transitions. [2018-07-23 13:36:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:36,892 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:36,892 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:36,893 INFO L414 AbstractCegarLoop]: === Iteration 10 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash -713257336, now seen corresponding path program 1 times [2018-07-23 13:36:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:36,909 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:36:36,910 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:36,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:36,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:36,911 INFO L185 omatonBuilderFactory]: Interpolants [4643#true, 4644#false, 4645#(= product__local__threadpooling_end_1 product__global_next), 4646#(= product__local__threadpooling_i_0 product__local__threadpooling_end_1), 4647#(<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_i_0), 4648#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_0), 4649#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_0)] [2018-07-23 13:36:36,911 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:36:36,911 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:36,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:36,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:36,912 INFO L87 Difference]: Start difference. First operand 150 states and 463 transitions. Second operand 7 states. [2018-07-23 13:36:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:37,278 INFO L93 Difference]: Finished difference Result 271 states and 762 transitions. [2018-07-23 13:36:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:37,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:37,283 INFO L225 Difference]: With dead ends: 271 [2018-07-23 13:36:37,284 INFO L226 Difference]: Without dead ends: 267 [2018-07-23 13:36:37,284 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-23 13:36:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 177. [2018-07-23 13:36:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 13:36:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 550 transitions. [2018-07-23 13:36:37,366 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 550 transitions. Word has length 8 [2018-07-23 13:36:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:37,366 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 550 transitions. [2018-07-23 13:36:37,366 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 550 transitions. [2018-07-23 13:36:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:37,368 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:37,368 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:37,368 INFO L414 AbstractCegarLoop]: === Iteration 11 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash -714144432, now seen corresponding path program 1 times [2018-07-23 13:36:37,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:37,387 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:36:37,387 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:37,388 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:37,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:37,388 INFO L134 CoverageAnalysis]: 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,389 INFO L185 omatonBuilderFactory]: Interpolants [5560#true, 5561#false, 5562#(= product__local__threadpooling_end_1 product__global_next), 5563#(= product__local__threadpooling_i_0 product__local__threadpooling_end_1), 5564#(<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_0), 5565#(<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0), 5566#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_0)] [2018-07-23 13:36:37,389 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:36:37,392 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:37,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:37,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:37,393 INFO L87 Difference]: Start difference. First operand 177 states and 550 transitions. Second operand 7 states. [2018-07-23 13:36:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:37,764 INFO L93 Difference]: Finished difference Result 291 states and 819 transitions. [2018-07-23 13:36:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:37,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:37,768 INFO L225 Difference]: With dead ends: 291 [2018-07-23 13:36:37,768 INFO L226 Difference]: Without dead ends: 287 [2018-07-23 13:36:37,769 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:36:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-23 13:36:37,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 185. [2018-07-23 13:36:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 13:36:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 577 transitions. [2018-07-23 13:36:37,853 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 577 transitions. Word has length 8 [2018-07-23 13:36:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:37,854 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 577 transitions. [2018-07-23 13:36:37,854 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 577 transitions. [2018-07-23 13:36:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:37,855 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:37,855 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:37,856 INFO L414 AbstractCegarLoop]: === Iteration 12 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash -714147222, now seen corresponding path program 1 times [2018-07-23 13:36:37,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:37,873 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:36:37,874 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:37,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:37,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:37,874 INFO L134 CoverageAnalysis]: 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,875 INFO L185 omatonBuilderFactory]: Interpolants [6529#true, 6530#false, 6531#(= product__local__threadpooling_end_1 product__global_next), 6532#(= product__local__threadpooling_i_0 product__local__threadpooling_end_1), 6533#(<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_0), 6534#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_0), 6535#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_0)] [2018-07-23 13:36:37,875 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:36:37,875 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:37,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:37,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:37,876 INFO L87 Difference]: Start difference. First operand 185 states and 577 transitions. Second operand 7 states. [2018-07-23 13:36:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:38,367 INFO L93 Difference]: Finished difference Result 306 states and 862 transitions. [2018-07-23 13:36:38,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:38,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:38,370 INFO L225 Difference]: With dead ends: 306 [2018-07-23 13:36:38,371 INFO L226 Difference]: Without dead ends: 302 [2018-07-23 13:36:38,372 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-23 13:36:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 184. [2018-07-23 13:36:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-23 13:36:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 575 transitions. [2018-07-23 13:36:38,456 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 575 transitions. Word has length 8 [2018-07-23 13:36:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:38,456 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 575 transitions. [2018-07-23 13:36:38,457 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 575 transitions. [2018-07-23 13:36:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:38,458 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:38,458 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:38,458 INFO L414 AbstractCegarLoop]: === Iteration 13 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:38,458 INFO L82 PathProgramCache]: Analyzing trace with hash -735593952, now seen corresponding path program 1 times [2018-07-23 13:36:38,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:38,480 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:36:38,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:38,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:38,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:38,482 INFO L185 omatonBuilderFactory]: Interpolants [7528#true, 7529#false, 7530#(= product__global_next product__local__threadpooling_end_1), 7531#(and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (= product__local__threadpooling_end_0 product__global_next)), 7532#(<= (+ product__local__threadpooling_end_1 1) product__global_next), 7533#(<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_0), 7534#(<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0), 7535#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:38,483 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:36:38,484 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:38,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:38,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:38,485 INFO L87 Difference]: Start difference. First operand 184 states and 575 transitions. Second operand 8 states. [2018-07-23 13:36:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:38,929 INFO L93 Difference]: Finished difference Result 273 states and 771 transitions. [2018-07-23 13:36:38,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:38,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:36:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:38,932 INFO L225 Difference]: With dead ends: 273 [2018-07-23 13:36:38,932 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 13:36:38,933 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 13:36:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2018-07-23 13:36:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-23 13:36:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 560 transitions. [2018-07-23 13:36:39,019 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 560 transitions. Word has length 8 [2018-07-23 13:36:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:39,019 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 560 transitions. [2018-07-23 13:36:39,019 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 560 transitions. [2018-07-23 13:36:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:39,020 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:39,020 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:39,021 INFO L414 AbstractCegarLoop]: === Iteration 14 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash -735596742, now seen corresponding path program 1 times [2018-07-23 13:36:39,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:39,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:36:39,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:39,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:39,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:39,046 INFO L134 CoverageAnalysis]: 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,046 INFO L185 omatonBuilderFactory]: Interpolants [8454#true, 8455#false, 8456#(= product__global_next product__local__threadpooling_end_1), 8457#(and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (= product__local__threadpooling_end_0 product__global_next)), 8458#(<= (+ product__local__threadpooling_end_1 1) product__global_next), 8459#(<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_i_0), 8460#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 8461#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:39,046 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:36:39,047 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:39,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:39,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:39,047 INFO L87 Difference]: Start difference. First operand 180 states and 560 transitions. Second operand 8 states. [2018-07-23 13:36:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:39,465 INFO L93 Difference]: Finished difference Result 310 states and 878 transitions. [2018-07-23 13:36:39,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:39,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:36:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:39,469 INFO L225 Difference]: With dead ends: 310 [2018-07-23 13:36:39,469 INFO L226 Difference]: Without dead ends: 306 [2018-07-23 13:36:39,470 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:36:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-07-23 13:36:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 193. [2018-07-23 13:36:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 13:36:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 606 transitions. [2018-07-23 13:36:39,563 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 606 transitions. Word has length 8 [2018-07-23 13:36:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:39,563 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 606 transitions. [2018-07-23 13:36:39,563 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 606 transitions. [2018-07-23 13:36:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:39,565 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:39,565 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:39,566 INFO L414 AbstractCegarLoop]: === Iteration 15 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash -735510252, now seen corresponding path program 1 times [2018-07-23 13:36:39,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:39,595 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:36:39,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:39,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:36:39,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:39,596 INFO L134 CoverageAnalysis]: 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,596 INFO L185 omatonBuilderFactory]: Interpolants [9488#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 9489#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 9482#true, 9483#false, 9484#(= product__global_next product__local__threadpooling_end_1), 9485#(and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (= product__local__threadpooling_end_0 product__global_next)), 9486#(<= (+ product__local__threadpooling_end_1 1) product__global_next), 9487#(not (= product__local__threadpooling_working_1 product__global_next))] [2018-07-23 13:36:39,597 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:36:39,597 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:36:39,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:36:39,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:36:39,598 INFO L87 Difference]: Start difference. First operand 193 states and 606 transitions. Second operand 8 states. [2018-07-23 13:36:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:40,055 INFO L93 Difference]: Finished difference Result 348 states and 984 transitions. [2018-07-23 13:36:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:36:40,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:36:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:40,059 INFO L225 Difference]: With dead ends: 348 [2018-07-23 13:36:40,059 INFO L226 Difference]: Without dead ends: 344 [2018-07-23 13:36:40,060 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:36:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-07-23 13:36:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 225. [2018-07-23 13:36:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 13:36:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 702 transitions. [2018-07-23 13:36:40,187 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 702 transitions. Word has length 8 [2018-07-23 13:36:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:40,187 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 702 transitions. [2018-07-23 13:36:40,187 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:36:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 702 transitions. [2018-07-23 13:36:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:40,188 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:40,188 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:40,189 INFO L414 AbstractCegarLoop]: === Iteration 16 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:40,189 INFO L82 PathProgramCache]: Analyzing trace with hash -633327122, now seen corresponding path program 1 times [2018-07-23 13:36:40,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:40,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:40,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:40,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:40,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:40,204 INFO L185 omatonBuilderFactory]: Interpolants [10658#true, 10659#false, 10660#(= product__local__threadpooling_end_1 product__global_next), 10661#(<= (+ product__local__threadpooling_working_1 1) product__global_next), 10662#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 10663#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_0), 10664#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_0)] [2018-07-23 13:36:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:40,205 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:40,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:40,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:40,206 INFO L87 Difference]: Start difference. First operand 225 states and 702 transitions. Second operand 7 states. [2018-07-23 13:36:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:40,611 INFO L93 Difference]: Finished difference Result 389 states and 1133 transitions. [2018-07-23 13:36:40,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:36:40,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:40,623 INFO L225 Difference]: With dead ends: 389 [2018-07-23 13:36:40,624 INFO L226 Difference]: Without dead ends: 385 [2018-07-23 13:36:40,625 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-07-23 13:36:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 267. [2018-07-23 13:36:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-23 13:36:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 829 transitions. [2018-07-23 13:36:40,791 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 829 transitions. Word has length 8 [2018-07-23 13:36:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:40,792 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 829 transitions. [2018-07-23 13:36:40,792 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 829 transitions. [2018-07-23 13:36:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:40,793 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:40,793 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:40,793 INFO L414 AbstractCegarLoop]: === Iteration 17 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:40,794 INFO L82 PathProgramCache]: Analyzing trace with hash -632821636, now seen corresponding path program 1 times [2018-07-23 13:36:40,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:40,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:40,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:40,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:40,809 INFO L134 CoverageAnalysis]: 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,810 INFO L185 omatonBuilderFactory]: Interpolants [11989#true, 11990#false, 11991#(= product__local__threadpooling_end_1 product__global_next), 11992#(<= (+ product__local__threadpooling_working_1 1) product__global_next), 11993#(<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_i_0), 11994#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_0), 11995#(<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_working_0)] [2018-07-23 13:36:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:40,810 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:40,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:40,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:40,811 INFO L87 Difference]: Start difference. First operand 267 states and 829 transitions. Second operand 7 states. [2018-07-23 13:36:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:41,296 INFO L93 Difference]: Finished difference Result 339 states and 995 transitions. [2018-07-23 13:36:41,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:36:41,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:41,300 INFO L225 Difference]: With dead ends: 339 [2018-07-23 13:36:41,300 INFO L226 Difference]: Without dead ends: 335 [2018-07-23 13:36:41,301 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-23 13:36:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 236. [2018-07-23 13:36:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-23 13:36:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 725 transitions. [2018-07-23 13:36:41,472 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 725 transitions. Word has length 8 [2018-07-23 13:36:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:41,472 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 725 transitions. [2018-07-23 13:36:41,472 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 725 transitions. [2018-07-23 13:36:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:41,473 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:41,473 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:41,474 INFO L414 AbstractCegarLoop]: === Iteration 18 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:41,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1041857831, now seen corresponding path program 1 times [2018-07-23 13:36:41,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:41,491 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:41,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:41,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:41,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:36:41,492 INFO L185 omatonBuilderFactory]: Interpolants [13168#(<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_1), 13169#(<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1), 13170#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 13164#true, 13165#false, 13166#(= product__local__threadpooling_end_0 product__global_next), 13167#(= product__local__threadpooling_end_0 product__local__threadpooling_i_1)] [2018-07-23 13:36:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:41,493 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:41,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:41,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:41,494 INFO L87 Difference]: Start difference. First operand 236 states and 725 transitions. Second operand 7 states. [2018-07-23 13:36:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:42,085 INFO L93 Difference]: Finished difference Result 466 states and 1349 transitions. [2018-07-23 13:36:42,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:42,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:42,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:42,089 INFO L225 Difference]: With dead ends: 466 [2018-07-23 13:36:42,089 INFO L226 Difference]: Without dead ends: 462 [2018-07-23 13:36:42,090 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-07-23 13:36:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 274. [2018-07-23 13:36:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-07-23 13:36:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 850 transitions. [2018-07-23 13:36:42,273 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 850 transitions. Word has length 8 [2018-07-23 13:36:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:42,274 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 850 transitions. [2018-07-23 13:36:42,274 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 850 transitions. [2018-07-23 13:36:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:42,277 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:42,277 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:42,277 INFO L414 AbstractCegarLoop]: === Iteration 19 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1041854855, now seen corresponding path program 1 times [2018-07-23 13:36:42,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:42,289 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:42,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:36:42,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:42,290 INFO L134 CoverageAnalysis]: 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,290 INFO L185 omatonBuilderFactory]: Interpolants [14665#true, 14666#false, 14667#(<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1)), 14668#(<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)] [2018-07-23 13:36:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:42,291 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:36:42,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:36:42,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:42,292 INFO L87 Difference]: Start difference. First operand 274 states and 850 transitions. Second operand 4 states. [2018-07-23 13:36:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:42,471 INFO L93 Difference]: Finished difference Result 465 states and 1432 transitions. [2018-07-23 13:36:42,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:36:42,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-23 13:36:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:42,474 INFO L225 Difference]: With dead ends: 465 [2018-07-23 13:36:42,475 INFO L226 Difference]: Without dead ends: 240 [2018-07-23 13:36:42,476 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-07-23 13:36:42,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 170. [2018-07-23 13:36:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-23 13:36:42,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 487 transitions. [2018-07-23 13:36:42,635 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 487 transitions. Word has length 8 [2018-07-23 13:36:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:42,635 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 487 transitions. [2018-07-23 13:36:42,635 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:36:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 487 transitions. [2018-07-23 13:36:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:42,639 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:42,639 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:42,639 INFO L414 AbstractCegarLoop]: === Iteration 20 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1043246476, now seen corresponding path program 1 times [2018-07-23 13:36:42,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:42,653 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:36:42,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:42,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:42,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:42,654 INFO L134 CoverageAnalysis]: 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,654 INFO L185 omatonBuilderFactory]: Interpolants [15939#true, 15940#false, 15941#(= product__global_next product__local__threadpooling_end_0), 15942#(<= (+ product__local__threadpooling_end_0 1) product__global_next), 15943#(<= (+ product__local__threadpooling_working_0 2) product__global_next), 15944#(not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)), 15945#(not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))] [2018-07-23 13:36:42,655 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:36:42,655 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:42,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:42,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:42,656 INFO L87 Difference]: Start difference. First operand 170 states and 487 transitions. Second operand 7 states. [2018-07-23 13:36:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:43,282 INFO L93 Difference]: Finished difference Result 379 states and 1034 transitions. [2018-07-23 13:36:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:36:43,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:43,286 INFO L225 Difference]: With dead ends: 379 [2018-07-23 13:36:43,286 INFO L226 Difference]: Without dead ends: 375 [2018-07-23 13:36:43,287 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:36:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-07-23 13:36:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 258. [2018-07-23 13:36:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-07-23 13:36:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 763 transitions. [2018-07-23 13:36:43,530 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 763 transitions. Word has length 8 [2018-07-23 13:36:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:43,530 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 763 transitions. [2018-07-23 13:36:43,530 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 763 transitions. [2018-07-23 13:36:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:43,531 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:43,531 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:43,531 INFO L414 AbstractCegarLoop]: === Iteration 21 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1047210601, now seen corresponding path program 1 times [2018-07-23 13:36:43,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:43,543 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:36:43,544 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:43,544 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:43,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:43,544 INFO L134 CoverageAnalysis]: 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,544 INFO L185 omatonBuilderFactory]: Interpolants [17248#(= product__local__threadpooling_end_0 product__global_next), 17249#(= product__local__threadpooling_i_1 product__local__threadpooling_end_0), 17250#(<= (+ product__local__threadpooling_end_0 1) product__local__threadpooling_i_1), 17251#(<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1), 17252#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 17246#true, 17247#false] [2018-07-23 13:36:43,545 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:36:43,545 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:43,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:43,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:43,547 INFO L87 Difference]: Start difference. First operand 258 states and 763 transitions. Second operand 7 states. [2018-07-23 13:36:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:44,224 INFO L93 Difference]: Finished difference Result 448 states and 1217 transitions. [2018-07-23 13:36:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:44,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:44,228 INFO L225 Difference]: With dead ends: 448 [2018-07-23 13:36:44,228 INFO L226 Difference]: Without dead ends: 444 [2018-07-23 13:36:44,229 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-07-23 13:36:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 268. [2018-07-23 13:36:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-07-23 13:36:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 802 transitions. [2018-07-23 13:36:44,502 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 802 transitions. Word has length 8 [2018-07-23 13:36:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:44,502 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 802 transitions. [2018-07-23 13:36:44,503 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 802 transitions. [2018-07-23 13:36:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:44,503 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:44,504 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:44,504 INFO L414 AbstractCegarLoop]: === Iteration 22 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1047213391, now seen corresponding path program 1 times [2018-07-23 13:36:44,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:44,525 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:36:44,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:44,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:44,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:44,526 INFO L134 CoverageAnalysis]: 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,528 INFO L185 omatonBuilderFactory]: Interpolants [18697#true, 18698#false, 18699#(= product__local__threadpooling_end_0 product__global_next), 18700#(= product__local__threadpooling_i_1 product__local__threadpooling_end_0), 18701#(<= (+ product__local__threadpooling_end_0 1) product__local__threadpooling_i_1), 18702#(or (<= (+ product__local__threadpooling_end_0 1) product__local__threadpooling_working_1) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 18703#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:44,528 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:36:44,528 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:44,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:44,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:44,529 INFO L87 Difference]: Start difference. First operand 268 states and 802 transitions. Second operand 7 states. [2018-07-23 13:36:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:45,370 INFO L93 Difference]: Finished difference Result 448 states and 1220 transitions. [2018-07-23 13:36:45,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:45,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:45,375 INFO L225 Difference]: With dead ends: 448 [2018-07-23 13:36:45,375 INFO L226 Difference]: Without dead ends: 444 [2018-07-23 13:36:45,376 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-07-23 13:36:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 259. [2018-07-23 13:36:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-23 13:36:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 767 transitions. [2018-07-23 13:36:45,655 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 767 transitions. Word has length 8 [2018-07-23 13:36:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:45,656 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 767 transitions. [2018-07-23 13:36:45,656 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 767 transitions. [2018-07-23 13:36:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:45,657 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:45,657 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:45,657 INFO L414 AbstractCegarLoop]: === Iteration 23 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1119662313, now seen corresponding path program 1 times [2018-07-23 13:36:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:45,671 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:36:45,672 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:45,672 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:45,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:45,673 INFO L185 omatonBuilderFactory]: Interpolants [20130#true, 20131#false, 20132#(= product__global_next product__local__threadpooling_end_0), 20133#(<= (+ product__local__threadpooling_end_0 1) product__global_next), 20134#(<= (+ product__local__threadpooling_end_0 1) product__local__threadpooling_i_1), 20135#(<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1), 20136#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:45,673 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:36:45,673 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:45,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:45,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:45,674 INFO L87 Difference]: Start difference. First operand 259 states and 767 transitions. Second operand 7 states. [2018-07-23 13:36:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:46,361 INFO L93 Difference]: Finished difference Result 421 states and 1143 transitions. [2018-07-23 13:36:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:36:46,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:46,365 INFO L225 Difference]: With dead ends: 421 [2018-07-23 13:36:46,365 INFO L226 Difference]: Without dead ends: 417 [2018-07-23 13:36:46,365 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:36:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-07-23 13:36:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 256. [2018-07-23 13:36:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-23 13:36:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 758 transitions. [2018-07-23 13:36:46,595 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 758 transitions. Word has length 8 [2018-07-23 13:36:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:46,596 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 758 transitions. [2018-07-23 13:36:46,596 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 758 transitions. [2018-07-23 13:36:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:46,597 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:46,597 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:46,597 INFO L414 AbstractCegarLoop]: === Iteration 24 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1119665103, now seen corresponding path program 1 times [2018-07-23 13:36:46,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:46,611 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:36:46,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:46,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:46,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:46,613 INFO L185 omatonBuilderFactory]: Interpolants [21505#true, 21506#false, 21507#(= product__global_next product__local__threadpooling_end_0), 21508#(<= (+ product__local__threadpooling_end_0 1) product__global_next), 21509#(<= (+ product__local__threadpooling_end_0 1) product__local__threadpooling_i_1), 21510#(or (<= (+ product__local__threadpooling_end_0 1) product__local__threadpooling_working_1) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))), 21511#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))] [2018-07-23 13:36:46,613 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:36:46,613 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:46,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:46,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:46,614 INFO L87 Difference]: Start difference. First operand 256 states and 758 transitions. Second operand 7 states. [2018-07-23 13:36:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:47,265 INFO L93 Difference]: Finished difference Result 403 states and 1093 transitions. [2018-07-23 13:36:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:36:47,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:47,268 INFO L225 Difference]: With dead ends: 403 [2018-07-23 13:36:47,268 INFO L226 Difference]: Without dead ends: 399 [2018-07-23 13:36:47,269 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:36:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-07-23 13:36:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 232. [2018-07-23 13:36:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-23 13:36:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 668 transitions. [2018-07-23 13:36:47,469 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 668 transitions. Word has length 8 [2018-07-23 13:36:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:47,470 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 668 transitions. [2018-07-23 13:36:47,470 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 668 transitions. [2018-07-23 13:36:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:36:47,471 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:47,471 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:47,471 INFO L414 AbstractCegarLoop]: === Iteration 25 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 992658932, now seen corresponding path program 1 times [2018-07-23 13:36:47,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:47,482 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:47,482 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:36:47,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:47,483 INFO L185 omatonBuilderFactory]: Interpolants [22800#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 22794#true, 22795#false, 22796#(= product__local__threadpooling_end_0 product__global_next), 22797#(<= (+ product__local__threadpooling_working_0 1) product__global_next), 22798#(<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_i_1), 22799#(<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)] [2018-07-23 13:36:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:47,483 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:36:47,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:36:47,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:36:47,484 INFO L87 Difference]: Start difference. First operand 232 states and 668 transitions. Second operand 7 states. [2018-07-23 13:36:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:48,016 INFO L93 Difference]: Finished difference Result 348 states and 951 transitions. [2018-07-23 13:36:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:36:48,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:36:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:48,019 INFO L225 Difference]: With dead ends: 348 [2018-07-23 13:36:48,020 INFO L226 Difference]: Without dead ends: 344 [2018-07-23 13:36:48,020 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:36:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-07-23 13:36:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 152. [2018-07-23 13:36:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-23 13:36:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 428 transitions. [2018-07-23 13:36:48,269 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 428 transitions. Word has length 8 [2018-07-23 13:36:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:48,269 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 428 transitions. [2018-07-23 13:36:48,270 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:36:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 428 transitions. [2018-07-23 13:36:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:48,270 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:48,270 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:48,271 INFO L414 AbstractCegarLoop]: === Iteration 26 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1843754049, now seen corresponding path program 1 times [2018-07-23 13:36:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:36:48,289 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:48,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:36:48,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:48,290 INFO L134 CoverageAnalysis]: 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,290 INFO L185 omatonBuilderFactory]: Interpolants [23819#true, 23820#false, 23821#(= product__local__threadpooling_end_0 product__global_next), 23822#(<= (+ product__local__threadpooling_i_0 1) product__local__threadpooling_end_0)] [2018-07-23 13:36:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:36:48,291 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:36:48,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:36:48,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:48,292 INFO L87 Difference]: Start difference. First operand 152 states and 428 transitions. Second operand 4 states. [2018-07-23 13:36:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:48,601 INFO L93 Difference]: Finished difference Result 288 states and 788 transitions. [2018-07-23 13:36:48,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:36:48,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-23 13:36:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:48,603 INFO L225 Difference]: With dead ends: 288 [2018-07-23 13:36:48,604 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 13:36:48,604 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:36:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 13:36:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2018-07-23 13:36:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-23 13:36:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 302 transitions. [2018-07-23 13:36:48,884 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 302 transitions. Word has length 10 [2018-07-23 13:36:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:48,884 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 302 transitions. [2018-07-23 13:36:48,884 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:36:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 302 transitions. [2018-07-23 13:36:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:36:48,885 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:48,886 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:48,886 INFO L414 AbstractCegarLoop]: === Iteration 27 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1832478577, now seen corresponding path program 1 times [2018-07-23 13:36:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:48,898 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:36:48,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:36:48,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:48,898 INFO L134 CoverageAnalysis]: 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,899 INFO L185 omatonBuilderFactory]: Interpolants [24649#true, 24650#false, 24651#(<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1)), 24652#(<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)] [2018-07-23 13:36:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:48,899 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:36:48,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:36:48,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:48,900 INFO L87 Difference]: Start difference. First operand 124 states and 302 transitions. Second operand 4 states. [2018-07-23 13:36:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:49,237 INFO L93 Difference]: Finished difference Result 260 states and 641 transitions. [2018-07-23 13:36:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:36:49,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-23 13:36:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:49,239 INFO L225 Difference]: With dead ends: 260 [2018-07-23 13:36:49,239 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 13:36:49,240 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:36:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 13:36:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 65. [2018-07-23 13:36:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:36:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 145 transitions. [2018-07-23 13:36:49,477 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 145 transitions. Word has length 10 [2018-07-23 13:36:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:49,478 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 145 transitions. [2018-07-23 13:36:49,478 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:36:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 145 transitions. [2018-07-23 13:36:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:36:49,478 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:49,479 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:49,479 INFO L414 AbstractCegarLoop]: === Iteration 28 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:49,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1370726818, now seen corresponding path program 1 times [2018-07-23 13:36:49,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:49,531 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:49,531 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:36:49,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:49,532 INFO L134 CoverageAnalysis]: 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,532 INFO L185 omatonBuilderFactory]: Interpolants [25312#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 25313#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 25303#true, 25304#false, 25305#(= product__local__threadpooling_end_1 product__global_next), 25306#(and (= product__local__threadpooling_i_0 product__local__threadpooling_end_1) (= product__local__threadpooling_end_0 product__global_next)), 25307#(and (= product__local__threadpooling_i_0 product__local__threadpooling_end_1) (= product__local__threadpooling_end_0 product__global_next) (<= (+ product__local__threadpooling_i_0 1) product__local__threadpooling_end_0)), 25308#(and (<= (+ product__local__threadpooling_working_1 product__local__threadpooling_i_0 2) (+ product__local__threadpooling_end_1 product__local__threadpooling_end_0)) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1) (= product__local__threadpooling_end_0 product__global_next)), 25309#(and (= product__local__threadpooling_end_0 product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_end_0)), 25310#(<= (+ product__local__threadpooling_working_1 2) product__global_next), 25311#(not (= product__local__threadpooling_working_1 product__global_next))] [2018-07-23 13:36:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:49,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:36:49,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:36:49,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:36:49,534 INFO L87 Difference]: Start difference. First operand 65 states and 145 transitions. Second operand 11 states. [2018-07-23 13:36:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:50,592 INFO L93 Difference]: Finished difference Result 214 states and 474 transitions. [2018-07-23 13:36:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:36:50,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-07-23 13:36:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:50,595 INFO L225 Difference]: With dead ends: 214 [2018-07-23 13:36:50,595 INFO L226 Difference]: Without dead ends: 210 [2018-07-23 13:36:50,596 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:36:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-23 13:36:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 69. [2018-07-23 13:36:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 13:36:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 158 transitions. [2018-07-23 13:36:50,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 158 transitions. Word has length 13 [2018-07-23 13:36:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:50,818 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 158 transitions. [2018-07-23 13:36:50,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:36:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 158 transitions. [2018-07-23 13:36:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:36:50,819 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:36:50,819 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:36:50,819 INFO L414 AbstractCegarLoop]: === Iteration 29 === [productErr5AssertViolationASSERT, productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr4AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:36:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash -247522178, now seen corresponding path program 1 times [2018-07-23 13:36:50,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:36:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:36:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:50,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:36:50,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:36:50,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:36:50,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:50,855 INFO L185 omatonBuilderFactory]: Interpolants [25920#(not (= product__local__threadpooling_working_1 product__global_next)), 25921#(not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)), 25922#(not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)), 25912#true, 25913#false, 25914#(= product__local__threadpooling_end_1 product__global_next), 25915#(and (= product__local__threadpooling_i_0 product__local__threadpooling_end_1) (= product__local__threadpooling_end_0 product__global_next)), 25916#(and (= product__local__threadpooling_i_0 product__local__threadpooling_end_1) (= product__local__threadpooling_end_0 product__global_next) (<= (+ product__local__threadpooling_i_0 1) product__local__threadpooling_end_0)), 25917#(and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (= product__local__threadpooling_end_0 product__global_next)), 25918#(<= (+ product__local__threadpooling_end_1 1) product__global_next), 25919#(<= (+ product__local__threadpooling_working_1 2) product__global_next)] [2018-07-23 13:36:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:36:50,855 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:36:50,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:36:50,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:36:50,856 INFO L87 Difference]: Start difference. First operand 69 states and 158 transitions. Second operand 11 states. [2018-07-23 13:36:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:36:51,978 INFO L93 Difference]: Finished difference Result 177 states and 397 transitions. [2018-07-23 13:36:51,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:36:51,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-07-23 13:36:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:36:51,978 INFO L225 Difference]: With dead ends: 177 [2018-07-23 13:36:51,978 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:36:51,979 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:36:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:36:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:36:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:36:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:36:51,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-07-23 13:36:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:36:51,982 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:36:51,982 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:36:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:36:51,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:36:51,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:36:52,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:52,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:52,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:52,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:53,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:53,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:53,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,401 WARN L169 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 608 DAG size of output: 427 [2018-07-23 13:36:54,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,523 WARN L169 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 117 [2018-07-23 13:36:54,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:54,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:55,960 WARN L169 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 587 DAG size of output: 419 [2018-07-23 13:36:55,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:56,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,622 WARN L169 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 710 DAG size of output: 494 [2018-07-23 13:36:57,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:57,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:58,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:58,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:58,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:58,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:58,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:58,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:36:59,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:00,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:00,730 WARN L169 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 953 DAG size of output: 654 [2018-07-23 13:37:01,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:01,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:01,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:02,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,581 WARN L169 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 656 DAG size of output: 481 [2018-07-23 13:37:03,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:03,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:04,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:04,314 WARN L169 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 501 DAG size of output: 348 [2018-07-23 13:37:04,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:04,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:04,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:04,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:04,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:04,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:05,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:05,611 WARN L169 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 677 DAG size of output: 438 [2018-07-23 13:37:05,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:05,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:07,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:07,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:08,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:37:09,026 WARN L169 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 660 DAG size of output: 425 [2018-07-23 13:37:11,082 WARN L169 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 388 DAG size of output: 45 [2018-07-23 13:37:11,335 WARN L169 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 39 [2018-07-23 13:37:13,059 WARN L169 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 382 DAG size of output: 86 [2018-07-23 13:37:15,352 WARN L169 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 447 DAG size of output: 81 [2018-07-23 13:37:19,515 WARN L169 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 622 DAG size of output: 90 [2018-07-23 13:37:21,974 WARN L169 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 465 DAG size of output: 52 [2018-07-23 13:37:22,875 WARN L169 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 48 [2018-07-23 13:37:24,169 WARN L169 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 413 DAG size of output: 51 [2018-07-23 13:37:25,946 WARN L169 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 421 DAG size of output: 45 [2018-07-23 13:37:25,951 INFO L417 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse22 (+ product__local__threadpooling_i_0 1)) (.cse21 (+ product__local__threadpooling_end_1 1)) (.cse23 (+ product__local__threadpooling_working_0 1)) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse12 (= product__local__threadpooling_end_1 product__global_next)) (.cse13 (+ product__local__threadpooling_working_1 1)) (.cse8 (+ product__local__threadpooling_end_0 1)) (.cse2 (+ product__local__threadpooling_working_0 2)) (.cse19 (+ product__local__threadpooling_working_1 2))) (let ((.cse1 (<= .cse19 product__local__threadpooling_i_0)) (.cse3 (<= .cse2 product__global_next)) (.cse10 (<= .cse8 product__global_next)) (.cse9 (and .cse11 .cse12 (<= .cse13 product__global_next))) (.cse15 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse5 (= product__global_next product__local__threadpooling_end_0)) (.cse7 (<= .cse23 product__global_next)) (.cse18 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse17 (<= .cse21 product__local__threadpooling_working_0)) (.cse4 (<= product__local__threadpooling_end_0 .cse22)) (.cse14 (<= .cse23 product__local__threadpooling_i_1)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse6 (<= .cse22 product__local__threadpooling_end_0))) (or (and (and .cse0 (and (and (and .cse1 (<= .cse2 product__local__threadpooling_i_1) .cse3) .cse4) .cse5) .cse6) (= product__local__threadpooling_i_0 product__local__threadpooling_end_1)) (and .cse0 .cse6 (or (and .cse7 (or (and (<= .cse8 product__local__threadpooling_i_1) (and .cse9 .cse4 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse10)) (and .cse4 (and .cse11 .cse12 (<= .cse13 product__local__threadpooling_i_0)) .cse10)) .cse14) (and (and (and .cse1 .cse12 .cse3) .cse4) .cse10))) (and .cse0 (and .cse7 .cse10 (and .cse15 .cse9) .cse14)) (and .cse7 .cse0 (let ((.cse16 (= product__local__threadpooling_end_0 product__global_next))) (or (and .cse15 .cse11 .cse16 .cse17) (and .cse15 .cse11 .cse18 .cse16))) (<= .cse19 product__global_next)) (and (and (and .cse5 .cse7 (or (and (let ((.cse20 (<= .cse21 product__local__threadpooling_i_0))) (or (and .cse20 (or (and .cse11 .cse18) (and .cse11 .cse17))) (and .cse20 .cse11 .cse14))) .cse4) (and .cse11 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse4 .cse14))) .cse0 .cse6) (<= .cse19 product__local__threadpooling_end_0))))) [2018-07-23 13:37:25,951 INFO L417 ceAbstractionStarter]: At program point productErr1AssertViolationASSERT(line 82) the Hoare annotation is: false [2018-07-23 13:37:25,952 INFO L417 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse22 (+ product__local__threadpooling_end_1 1)) (.cse5 (+ product__local__threadpooling_working_1 2)) (.cse24 (+ product__local__threadpooling_working_0 1)) (.cse11 (+ product__local__threadpooling_end_0 1)) (.cse15 (+ product__local__threadpooling_working_1 1))) (let ((.cse10 (<= .cse15 product__global_next)) (.cse9 (= product__local__threadpooling_end_1 product__global_next)) (.cse13 (<= .cse11 product__global_next)) (.cse14 (<= .cse24 product__local__threadpooling_i_1)) (.cse17 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse3 (<= .cse5 product__global_next)) (.cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse12 (<= .cse24 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse19 (= product__local__threadpooling_end_0 product__global_next)) (.cse18 (<= .cse22 product__local__threadpooling_working_0)) (.cse20 (<= .cse5 product__local__threadpooling_end_0))) (or (let ((.cse16 (<= .cse22 product__local__threadpooling_i_0)) (.cse21 (+ product__local__threadpooling_i_0 1))) (let ((.cse1 (= product__global_next product__local__threadpooling_end_0)) (.cse4 (<= product__local__threadpooling_end_0 .cse21)) (.cse6 (and .cse2 .cse16)) (.cse8 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse7 (<= .cse21 product__local__threadpooling_end_0))) (or (or (and .cse0 (and .cse1 (or (and (and (and .cse2 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse3) .cse4) (and (and (<= .cse5 product__local__threadpooling_i_0) .cse6) .cse4)) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) .cse7) (and (and .cse8 (or (and .cse9 .cse10 (<= .cse11 product__local__threadpooling_i_1) .cse4 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (and (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse9 .cse4)) .cse12 .cse13 .cse14) .cse0)) (and (= product__local__threadpooling_i_0 product__local__threadpooling_end_1) (and (and .cse1 (and (and .cse8 (<= .cse15 product__local__threadpooling_i_0) .cse14) .cse4) .cse12) .cse0 .cse7)) (and (and .cse12 (and .cse4 (or (and .cse6 .cse14) (or (and .cse16 (and .cse8 .cse17)) (and .cse8 .cse18)))) .cse19) .cse0 .cse7 .cse20)))) (let ((.cse23 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (or (and (and (and .cse23 .cse10 (and .cse2 .cse9)) .cse12 .cse13 .cse14) .cse0) (and .cse23 .cse0 .cse17 .cse19 (<= .cse22 product__local__threadpooling_end_0) .cse2 .cse3)) (and .cse23 .cse2 .cse12 .cse0 .cse19 .cse18 .cse20)))))) [2018-07-23 13:37:25,953 INFO L417 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse8 (+ product__local__threadpooling_i_0 1)) (.cse3 (+ product__local__threadpooling_working_0 1))) (let ((.cse0 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse1 (<= .cse3 product__global_next)) (.cse4 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse2 (<= product__local__threadpooling_end_0 .cse8)) (.cse5 (<= .cse8 product__local__threadpooling_end_0)) (.cse6 (+ product__local__threadpooling_working_1 2))) (or (or (and (and .cse0 (= product__local__threadpooling_end_1 product__global_next) .cse1 (<= (+ product__local__threadpooling_working_1 1) product__global_next) .cse2 (<= (+ product__local__threadpooling_end_0 1) product__global_next) (<= .cse3 product__local__threadpooling_i_1)) .cse4 .cse5) (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse2 (<= .cse6 product__global_next)) .cse4 .cse7 .cse5)) (and .cse0 .cse1 .cse4 .cse7 .cse2 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse5 (<= .cse6 product__local__threadpooling_end_0))))) [2018-07-23 13:37:25,953 INFO L424 ceAbstractionStarter]: At program point productENTRY(lines 3 236) the Hoare annotation is: true [2018-07-23 13:37:25,954 INFO L417 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse11 (+ product__local__threadpooling_working_1 2))) (let ((.cse1 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= (+ product__local__threadpooling_working_1 1) product__global_next)) (.cse5 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= .cse11 product__global_next)) (.cse7 (+ product__local__threadpooling_working_0 1))) (let ((.cse4 (<= .cse7 product__global_next)) (.cse6 (let ((.cse8 (let ((.cse10 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)))) (or (and .cse10 .cse1 .cse2) (or (and (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) .cse10 .cse5) .cse3) (and (<= .cse11 product__local__threadpooling_working_0) (<= .cse11 product__local__threadpooling_i_0) .cse3))))) (.cse9 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and .cse8 .cse9 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (and .cse8 (= product__global_next product__local__threadpooling_end_0) .cse9))))) (or (let ((.cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3))) (and .cse4 .cse5 .cse6) (and .cse4 .cse6 (<= .cse7 product__local__threadpooling_i_1)))))) [2018-07-23 13:37:25,954 INFO L417 ceAbstractionStarter]: At program point productErr2AssertViolationASSERT(line 171) the Hoare annotation is: false [2018-07-23 13:37:25,954 INFO L421 ceAbstractionStarter]: For program point L196(lines 196 201) no Hoare annotation was computed. [2018-07-23 13:37:25,956 INFO L417 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse26 (+ product__local__threadpooling_working_1 2)) (.cse19 (= product__local__threadpooling_end_1 product__global_next)) (.cse20 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse22 (or (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)))) (let ((.cse23 (and .cse19 (let ((.cse27 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)))) (or (and .cse27 .cse20) (and .cse27 .cse22))))) (.cse9 (<= .cse26 product__local__threadpooling_working_0)) (.cse15 (<= .cse26 product__local__threadpooling_i_0)) (.cse8 (<= .cse26 product__global_next)) (.cse24 (+ product__local__threadpooling_working_1 1)) (.cse25 (+ product__local__threadpooling_working_0 1))) (let ((.cse7 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0)) (.cse11 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= .cse25 product__global_next)) (.cse5 (<= .cse25 product__local__threadpooling_i_1)) (.cse12 (<= .cse24 product__global_next)) (.cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (.cse2 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse3 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse13 (= product__global_next product__local__threadpooling_end_1)) (.cse6 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse14 (or (and .cse23 (<= .cse24 product__local__threadpooling_i_0) .cse8) (and .cse9 .cse15 .cse8)))) (or (let ((.cse10 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (let ((.cse1 (or (and .cse10 (and .cse12 (and .cse13 .cse6))) (and .cse14 .cse10)))) (or (and (and (and .cse0 .cse1) .cse2) .cse3) (and .cse4 (and .cse1 .cse2) .cse5) (and (or (and (and .cse6 .cse7) .cse8) .cse9) .cse10 .cse4 .cse11)))) (let ((.cse21 (+ product__local__threadpooling_i_0 1))) (let ((.cse16 (<= product__local__threadpooling_end_0 .cse21))) (let ((.cse18 (or (and (or (and .cse13 .cse22 .cse6) (and .cse23 .cse8)) .cse16) (and .cse14 .cse16))) (.cse17 (<= .cse21 product__local__threadpooling_end_0))) (or (and (and (or (and .cse7 .cse6 .cse8) .cse15) .cse4 .cse16) .cse11 .cse17) (and (and (and .cse18 .cse0) .cse2) .cse3 .cse17) (and (or (and .cse18 .cse4 .cse2 .cse5) (or (and (and (and (and .cse15 .cse19) .cse16) .cse0) .cse2) (and (and (and .cse6 .cse19 .cse12 .cse0) .cse16) .cse20 .cse2))) .cse3 .cse17))))))))) [2018-07-23 13:37:25,956 INFO L417 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (<= .cse9 product__local__threadpooling_i_1)) (.cse4 (<= .cse9 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1)))) (or (and .cse0 (let ((.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (let ((.cse1 (+ product__local__threadpooling_working_0 2))) (and (<= .cse1 product__global_next) (and .cse2 (<= .cse1 product__local__threadpooling_i_1) .cse3))) (and .cse4 (and (and (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse2 .cse3) .cse5) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse6)))) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (and .cse5 (let ((.cse7 (+ product__local__threadpooling_end_1 1)) (.cse8 (<= (+ product__local__threadpooling_working_1 2) product__global_next))) (or (and (or (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= .cse7 product__local__threadpooling_working_0)) .cse8) (and (and (<= .cse7 product__local__threadpooling_end_0) .cse8) .cse6))) .cse4) .cse0) (= product__local__threadpooling_end_0 product__global_next))))) [2018-07-23 13:37:25,957 INFO L421 ceAbstractionStarter]: For program point L95(lines 95 190) no Hoare annotation was computed. [2018-07-23 13:37:25,957 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 124) no Hoare annotation was computed. [2018-07-23 13:37:25,957 INFO L417 ceAbstractionStarter]: At program point productErr4AssertViolationASSERT(line 181) the Hoare annotation is: false [2018-07-23 13:37:25,957 INFO L417 ceAbstractionStarter]: At program point productErr3AssertViolationASSERT(line 176) the Hoare annotation is: false [2018-07-23 13:37:25,957 INFO L421 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-07-23 13:37:25,957 INFO L417 ceAbstractionStarter]: At program point productErr0AssertViolationASSERT(line 60) the Hoare annotation is: false [2018-07-23 13:37:25,957 INFO L421 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-07-23 13:37:25,957 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 48) no Hoare annotation was computed. [2018-07-23 13:37:25,958 INFO L417 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_working_0 1)) (.cse5 (+ product__local__threadpooling_i_0 1))) (let ((.cse1 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse3 (<= product__local__threadpooling_end_0 .cse5)) (.cse0 (<= .cse4 product__global_next)) (.cse2 (<= .cse5 product__local__threadpooling_end_0))) (or (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse0 .cse1 .cse2 (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_end_0) (or (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse3) (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse3))) (= product__local__threadpooling_end_0 product__global_next)) (and .cse1 (and (and (and (and (<= (+ product__local__threadpooling_working_1 1) product__global_next) (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)))) .cse3) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse0 (<= .cse4 product__local__threadpooling_i_1)) .cse2)))) [2018-07-23 13:37:25,959 INFO L417 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_0 1))) (let ((.cse6 (<= .cse9 product__local__threadpooling_i_1)) (.cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse1 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse5 (<= .cse9 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1)))) (or (and .cse0 (let ((.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (and (and .cse1 (and (and .cse2 .cse3) .cse4)) .cse5 (<= (+ product__local__threadpooling_end_0 1) product__global_next) .cse6) (and .cse3 .cse4 (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1))))) (and (and (let ((.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse8 (+ product__local__threadpooling_end_1 1))) (or (and .cse7 (<= .cse8 product__local__threadpooling_end_0) .cse6) (or (and .cse7 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (and .cse2 (<= .cse8 product__local__threadpooling_working_0))))) .cse1 .cse5) .cse0 (= product__local__threadpooling_end_0 product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_end_0))))) [2018-07-23 13:37:25,959 INFO L421 ceAbstractionStarter]: For program point L207(lines 207 212) no Hoare annotation was computed. [2018-07-23 13:37:25,960 INFO L417 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse8 (+ product__local__threadpooling_i_0 1)) (.cse5 (+ product__local__threadpooling_working_1 2))) (let ((.cse6 (<= .cse5 product__local__threadpooling_working_0)) (.cse7 (<= product__local__threadpooling_end_0 .cse8))) (let ((.cse0 (or (and .cse7 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (and (and .cse6 (<= .cse5 product__local__threadpooling_i_0)) .cse7))) (.cse1 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse2 (<= .cse8 product__local__threadpooling_end_0))) (or (and (and (and .cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next)) .cse1) (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1) .cse2) (and (let ((.cse4 (+ product__local__threadpooling_working_0 1))) (let ((.cse3 (<= .cse4 product__global_next))) (or (and .cse3 (and .cse0 .cse1) (<= .cse4 product__local__threadpooling_i_1)) (and (and (and (or (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse5 product__global_next)) .cse6) .cse7) (= product__local__threadpooling_end_0 product__global_next)) .cse3)))) .cse2))))) [2018-07-23 13:37:25,960 INFO L417 ceAbstractionStarter]: At program point productErr5AssertViolationASSERT(line 186) the Hoare annotation is: false [2018-07-23 13:37:25,960 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 159) no Hoare annotation was computed. [2018-07-23 13:37:25,983 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:37:25 BoogieIcfgContainer [2018-07-23 13:37:25,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:37:25,984 INFO L168 Benchmark]: Toolchain (without parser) took 52796.76 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 229.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-23 13:37:25,985 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.29 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:37:25,986 INFO L168 Benchmark]: Boogie Preprocessor took 56.10 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:37:25,986 INFO L168 Benchmark]: RCFGBuilder took 357.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:37:25,987 INFO L168 Benchmark]: TraceAbstraction took 52379.28 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 218.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-23 13:37:25,990 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.29 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 56.10 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 357.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52379.28 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 218.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 186]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 176]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 181]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 82]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 171]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_working_1 + 2 <= _global_next) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _global_next)) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1))) || ((((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0) && (((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (_local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_end_0 == _global_next) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || (((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || ((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 == _global_next) && ((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) || (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 + 1 <= _global_next) || (((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) || (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _global_next == _local__threadpooling_end_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0)))) || ((_local__threadpooling_working_0 + 1 <= _global_next && ((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) || (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 + 1 <= _global_next) || (((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) || (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _global_next == _local__threadpooling_end_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_working_0 + 2 <= _global_next && (_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _global_next) || ((_local__threadpooling_working_0 + 1 <= _global_next && (((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1))) || (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((_local__threadpooling_end_1 == _local__threadpooling_working_0 || _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (_global_next == _local__threadpooling_end_0 && ((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || ((_local__threadpooling_end_0 == _local__threadpooling_working_1 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1)) || (_local__threadpooling_i_0 == _local__threadpooling_end_1 && (((_global_next == _local__threadpooling_end_0 && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || (((((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (_local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0)) || (((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || ((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_1 + 2 <= _global_next)) || ((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _global_next == _local__threadpooling_end_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_0 == _local__threadpooling_end_1) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && (((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_0 + 1 <= _local__threadpooling_i_1 && ((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 + 1 <= _global_next) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 + 1 <= _global_next))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 + 1 <= _global_next)))) || (_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && ((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next))) && _local__threadpooling_working_1 + 2 <= _global_next)) || (((((_global_next == _local__threadpooling_end_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0 && ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) || ((_local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1))) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_working_0 + 2 <= _global_next && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_1 + 1 <= _global_next && _global_next == _local__threadpooling_end_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) || (((((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0))) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) || ((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_1 + 1 <= _global_next && _global_next == _local__threadpooling_end_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) || (((((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0)) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1)) || ((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next)) || ((((((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_1 + 2 <= _global_next) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((((((_global_next == _local__threadpooling_end_1 && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) || ((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || (((((((((((_global_next == _local__threadpooling_end_1 && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) || ((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((((_local__threadpooling_end_1 == _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_0 == _local__threadpooling_working_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0)))) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) || ((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 + 1 <= _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 6 error locations. SAFE Result, 52.2s OverallTime, 29 OverallIterations, 2 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 33.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1343 SDtfs, 3075 SDslu, 1608 SDs, 0 SdLazy, 12790 SolverSat, 1740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 15/56 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 2817 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 187 NumberOfFragments, 2173 HoareAnnotationTreeSize, 16 FomulaSimplifications, -3170003851945852467 FormulaSimplificationTreeSizeReduction, 17.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 184273471152356 FormulaSimplificationTreeSizeReductionInter, 16.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 5983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 15/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-37-26-011.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-37-26-011.csv Received shutdown request...