java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:36:09,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:36:09,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:36:09,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:36:09,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:36:09,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:36:09,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:36:09,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:36:09,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:36:09,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:36:09,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:36:09,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:36:09,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:36:09,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:36:09,640 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:36:09,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:36:09,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:36:09,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:36:09,645 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:36:09,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:36:09,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:36:09,650 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:36:09,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:36:09,653 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:36:09,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:36:09,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:36:09,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:36:09,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:36:09,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:36:09,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:36:09,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:36:09,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:36:09,659 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:36:09,660 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:36:09,661 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:36:09,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:36:09,662 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:36:09,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:36:09,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:36:09,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:36:09,678 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:36:09,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:36:09,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:36:09,679 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:36:09,679 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:36:09,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:36:09,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:36:09,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:36:09,753 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:36:09,753 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:36:09,754 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-25 08:36:09,755 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-07-25 08:36:09,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:36:09,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:36:09,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:09,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:36:09,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:36:09,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,879 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:36:09,879 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:36:09,880 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:36:09,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:09,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:36:09,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:36:09,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:36:09,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:36:09,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:36:09,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:36:09,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:36:09,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:10,000 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 08:36:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 08:36:10,000 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 08:36:10,210 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:36:10,210 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:10 BoogieIcfgContainer [2018-07-25 08:36:10,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:36:10,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:36:10,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:36:10,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:36:10,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/2) ... [2018-07-25 08:36:10,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1865e5f1 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:36:10, skipping insertion in model container [2018-07-25 08:36:10,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:10" (2/2) ... [2018-07-25 08:36:10,221 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-07-25 08:36:10,233 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:36:10,243 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-07-25 08:36:10,303 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:36:10,304 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:36:10,304 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:36:10,304 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:36:10,305 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:36:10,305 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:36:10,305 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:36:10,306 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:36:10,306 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:36:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-07-25 08:36:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:36:10,340 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:10,341 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:36:10,343 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash 934210, now seen corresponding path program 1 times [2018-07-25 08:36:10,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:10,470 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:10,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:36:10,476 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:10,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:10,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:10,494 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2018-07-25 08:36:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:10,767 INFO L93 Difference]: Finished difference Result 30 states and 67 transitions. [2018-07-25 08:36:10,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:36:10,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 08:36:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:10,784 INFO L225 Difference]: With dead ends: 30 [2018-07-25 08:36:10,785 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 08:36:10,789 INFO L574 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-25 08:36:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 08:36:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-07-25 08:36:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 08:36:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2018-07-25 08:36:10,840 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 48 transitions. Word has length 4 [2018-07-25 08:36:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:10,840 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 48 transitions. [2018-07-25 08:36:10,841 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 48 transitions. [2018-07-25 08:36:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:36:10,841 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:10,842 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:36:10,842 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:10,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1042904, now seen corresponding path program 1 times [2018-07-25 08:36:10,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:10,900 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:10,900 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:36:10,902 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:10,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:10,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:10,903 INFO L87 Difference]: Start difference. First operand 22 states and 48 transitions. Second operand 5 states. [2018-07-25 08:36:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:11,226 INFO L93 Difference]: Finished difference Result 50 states and 117 transitions. [2018-07-25 08:36:11,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:36:11,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 08:36:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:11,228 INFO L225 Difference]: With dead ends: 50 [2018-07-25 08:36:11,229 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:36:11,230 INFO L574 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-25 08:36:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:36:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-07-25 08:36:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 08:36:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 101 transitions. [2018-07-25 08:36:11,250 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 101 transitions. Word has length 4 [2018-07-25 08:36:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:11,251 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 101 transitions. [2018-07-25 08:36:11,251 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 101 transitions. [2018-07-25 08:36:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:36:11,252 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:11,255 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 08:36:11,256 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash 897576008, now seen corresponding path program 1 times [2018-07-25 08:36:11,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:11,292 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:11,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:11,292 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:11,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:11,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:11,293 INFO L87 Difference]: Start difference. First operand 40 states and 101 transitions. Second operand 6 states. [2018-07-25 08:36:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:11,624 INFO L93 Difference]: Finished difference Result 152 states and 379 transitions. [2018-07-25 08:36:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:11,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:36:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:11,632 INFO L225 Difference]: With dead ends: 152 [2018-07-25 08:36:11,637 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 08:36:11,638 INFO L574 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-25 08:36:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 08:36:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 76. [2018-07-25 08:36:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:36:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 225 transitions. [2018-07-25 08:36:11,689 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 225 transitions. Word has length 6 [2018-07-25 08:36:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:11,691 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 225 transitions. [2018-07-25 08:36:11,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 225 transitions. [2018-07-25 08:36:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:36:11,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:11,692 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 08:36:11,693 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash 897578922, now seen corresponding path program 1 times [2018-07-25 08:36:11,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:11,706 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:11,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:11,707 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:11,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:11,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:11,708 INFO L87 Difference]: Start difference. First operand 76 states and 225 transitions. Second operand 6 states. [2018-07-25 08:36:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:11,871 INFO L93 Difference]: Finished difference Result 148 states and 381 transitions. [2018-07-25 08:36:11,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:11,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:36:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:11,877 INFO L225 Difference]: With dead ends: 148 [2018-07-25 08:36:11,877 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 08:36:11,878 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 08:36:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2018-07-25 08:36:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:36:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 262 transitions. [2018-07-25 08:36:11,927 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 262 transitions. Word has length 6 [2018-07-25 08:36:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:11,928 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 262 transitions. [2018-07-25 08:36:11,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 262 transitions. [2018-07-25 08:36:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:36:11,929 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:11,932 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 08:36:11,932 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:11,933 INFO L82 PathProgramCache]: Analyzing trace with hash 897783584, now seen corresponding path program 1 times [2018-07-25 08:36:11,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:11,950 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:11,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:11,951 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:11,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:11,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:11,954 INFO L87 Difference]: Start difference. First operand 87 states and 262 transitions. Second operand 6 states. [2018-07-25 08:36:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:12,145 INFO L93 Difference]: Finished difference Result 171 states and 457 transitions. [2018-07-25 08:36:12,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:12,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:36:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:12,148 INFO L225 Difference]: With dead ends: 171 [2018-07-25 08:36:12,148 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:36:12,149 INFO L574 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-25 08:36:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:36:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 96. [2018-07-25 08:36:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:36:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 287 transitions. [2018-07-25 08:36:12,183 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 287 transitions. Word has length 6 [2018-07-25 08:36:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:12,183 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 287 transitions. [2018-07-25 08:36:12,184 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 287 transitions. [2018-07-25 08:36:12,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:36:12,185 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:12,185 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 08:36:12,186 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:12,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1002235768, now seen corresponding path program 1 times [2018-07-25 08:36:12,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:12,201 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-25 08:36:12,202 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:12,202 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:36:12,202 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:12,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:12,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:12,203 INFO L87 Difference]: Start difference. First operand 96 states and 287 transitions. Second operand 6 states. [2018-07-25 08:36:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:12,346 INFO L93 Difference]: Finished difference Result 117 states and 345 transitions. [2018-07-25 08:36:12,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:36:12,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:36:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:12,348 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:36:12,348 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:36:12,352 INFO L574 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-25 08:36:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:36:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2018-07-25 08:36:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:36:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 261 transitions. [2018-07-25 08:36:12,395 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 261 transitions. Word has length 6 [2018-07-25 08:36:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:12,395 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 261 transitions. [2018-07-25 08:36:12,395 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 261 transitions. [2018-07-25 08:36:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:36:12,396 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:12,397 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 08:36:12,397 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1002208758, now seen corresponding path program 1 times [2018-07-25 08:36:12,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:12,414 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:12,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:12,414 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:12,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:12,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:12,415 INFO L87 Difference]: Start difference. First operand 89 states and 261 transitions. Second operand 6 states. [2018-07-25 08:36:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:12,637 INFO L93 Difference]: Finished difference Result 203 states and 555 transitions. [2018-07-25 08:36:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:12,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:36:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:12,640 INFO L225 Difference]: With dead ends: 203 [2018-07-25 08:36:12,640 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 08:36:12,642 INFO L574 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-25 08:36:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 08:36:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 138. [2018-07-25 08:36:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 08:36:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 418 transitions. [2018-07-25 08:36:12,704 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 418 transitions. Word has length 6 [2018-07-25 08:36:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:12,705 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 418 transitions. [2018-07-25 08:36:12,705 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 418 transitions. [2018-07-25 08:36:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:36:12,711 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:12,711 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 08:36:12,713 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1000027257, now seen corresponding path program 1 times [2018-07-25 08:36:12,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:12,736 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:12,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:12,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:12,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:12,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:12,737 INFO L87 Difference]: Start difference. First operand 138 states and 418 transitions. Second operand 6 states. [2018-07-25 08:36:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:12,977 INFO L93 Difference]: Finished difference Result 233 states and 646 transitions. [2018-07-25 08:36:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:12,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:36:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:12,981 INFO L225 Difference]: With dead ends: 233 [2018-07-25 08:36:12,981 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 08:36:12,982 INFO L574 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-25 08:36:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 08:36:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 150. [2018-07-25 08:36:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 08:36:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 463 transitions. [2018-07-25 08:36:13,053 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 463 transitions. Word has length 6 [2018-07-25 08:36:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:13,053 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 463 transitions. [2018-07-25 08:36:13,053 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 463 transitions. [2018-07-25 08:36:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:36:13,055 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:13,055 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 08:36:13,058 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1000030171, now seen corresponding path program 1 times [2018-07-25 08:36:13,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:13,080 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:13,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:13,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:13,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:13,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:13,082 INFO L87 Difference]: Start difference. First operand 150 states and 463 transitions. Second operand 6 states. [2018-07-25 08:36:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:13,359 INFO L93 Difference]: Finished difference Result 246 states and 685 transitions. [2018-07-25 08:36:13,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:13,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:36:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:13,362 INFO L225 Difference]: With dead ends: 246 [2018-07-25 08:36:13,362 INFO L226 Difference]: Without dead ends: 242 [2018-07-25 08:36:13,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-25 08:36:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 150. [2018-07-25 08:36:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 08:36:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 463 transitions. [2018-07-25 08:36:13,423 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 463 transitions. Word has length 6 [2018-07-25 08:36:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:13,423 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 463 transitions. [2018-07-25 08:36:13,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 463 transitions. [2018-07-25 08:36:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:13,425 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:13,425 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:13,426 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:13,426 INFO L82 PathProgramCache]: Analyzing trace with hash -735598757, now seen corresponding path program 1 times [2018-07-25 08:36:13,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:13,459 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-25 08:36:13,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:13,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:13,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:13,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:13,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:13,462 INFO L87 Difference]: Start difference. First operand 150 states and 463 transitions. Second operand 8 states. [2018-07-25 08:36:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:13,873 INFO L93 Difference]: Finished difference Result 281 states and 789 transitions. [2018-07-25 08:36:13,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:13,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:13,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:13,876 INFO L225 Difference]: With dead ends: 281 [2018-07-25 08:36:13,877 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 08:36:13,877 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 08:36:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2018-07-25 08:36:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 08:36:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 536 transitions. [2018-07-25 08:36:13,957 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 536 transitions. Word has length 8 [2018-07-25 08:36:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:13,957 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 536 transitions. [2018-07-25 08:36:13,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 536 transitions. [2018-07-25 08:36:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:13,959 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:13,959 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:13,960 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash -735595843, now seen corresponding path program 1 times [2018-07-25 08:36:13,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:13,989 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-25 08:36:13,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:13,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:13,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:13,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:13,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:13,993 INFO L87 Difference]: Start difference. First operand 171 states and 536 transitions. Second operand 8 states. [2018-07-25 08:36:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:14,398 INFO L93 Difference]: Finished difference Result 260 states and 736 transitions. [2018-07-25 08:36:14,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:14,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:14,402 INFO L225 Difference]: With dead ends: 260 [2018-07-25 08:36:14,402 INFO L226 Difference]: Without dead ends: 256 [2018-07-25 08:36:14,403 INFO L574 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-25 08:36:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-25 08:36:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 167. [2018-07-25 08:36:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:36:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 523 transitions. [2018-07-25 08:36:14,492 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 523 transitions. Word has length 8 [2018-07-25 08:36:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:14,492 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 523 transitions. [2018-07-25 08:36:14,493 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 523 transitions. [2018-07-25 08:36:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:14,494 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:14,494 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:14,495 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash -735391181, now seen corresponding path program 1 times [2018-07-25 08:36:14,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:14,526 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-25 08:36:14,527 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:14,527 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:14,527 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:14,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:14,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:14,528 INFO L87 Difference]: Start difference. First operand 167 states and 523 transitions. Second operand 8 states. [2018-07-25 08:36:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:15,036 INFO L93 Difference]: Finished difference Result 329 states and 931 transitions. [2018-07-25 08:36:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:36:15,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:36:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:15,039 INFO L225 Difference]: With dead ends: 329 [2018-07-25 08:36:15,039 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 08:36:15,040 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 08:36:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 211. [2018-07-25 08:36:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 08:36:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 662 transitions. [2018-07-25 08:36:15,141 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 662 transitions. Word has length 8 [2018-07-25 08:36:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:15,141 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 662 transitions. [2018-07-25 08:36:15,142 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 662 transitions. [2018-07-25 08:36:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:15,143 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:15,143 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:15,143 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash -717875034, now seen corresponding path program 1 times [2018-07-25 08:36:15,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:15,158 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-25 08:36:15,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:15,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:15,159 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:15,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:15,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:15,160 INFO L87 Difference]: Start difference. First operand 211 states and 662 transitions. Second operand 7 states. [2018-07-25 08:36:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:15,536 INFO L93 Difference]: Finished difference Result 339 states and 980 transitions. [2018-07-25 08:36:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:15,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:15,540 INFO L225 Difference]: With dead ends: 339 [2018-07-25 08:36:15,540 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 08:36:15,541 INFO L574 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-25 08:36:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 08:36:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 233. [2018-07-25 08:36:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 08:36:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 731 transitions. [2018-07-25 08:36:15,661 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 731 transitions. Word has length 8 [2018-07-25 08:36:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:15,662 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 731 transitions. [2018-07-25 08:36:15,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 731 transitions. [2018-07-25 08:36:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:15,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:15,663 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:15,664 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash -715996279, now seen corresponding path program 1 times [2018-07-25 08:36:15,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:15,677 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-25 08:36:15,677 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:15,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:15,678 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:15,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:15,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:15,679 INFO L87 Difference]: Start difference. First operand 233 states and 731 transitions. Second operand 7 states. [2018-07-25 08:36:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:16,100 INFO L93 Difference]: Finished difference Result 379 states and 1067 transitions. [2018-07-25 08:36:16,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:16,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:16,104 INFO L225 Difference]: With dead ends: 379 [2018-07-25 08:36:16,104 INFO L226 Difference]: Without dead ends: 375 [2018-07-25 08:36:16,105 INFO L574 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-25 08:36:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-07-25 08:36:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 227. [2018-07-25 08:36:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 08:36:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 710 transitions. [2018-07-25 08:36:16,210 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 710 transitions. Word has length 8 [2018-07-25 08:36:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:16,210 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 710 transitions. [2018-07-25 08:36:16,210 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 710 transitions. [2018-07-25 08:36:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:16,211 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:16,211 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:16,212 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:16,212 INFO L82 PathProgramCache]: Analyzing trace with hash -715993365, now seen corresponding path program 1 times [2018-07-25 08:36:16,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:16,226 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-25 08:36:16,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:16,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:16,227 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:16,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:16,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:16,228 INFO L87 Difference]: Start difference. First operand 227 states and 710 transitions. Second operand 7 states. [2018-07-25 08:36:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:16,609 INFO L93 Difference]: Finished difference Result 372 states and 1062 transitions. [2018-07-25 08:36:16,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:16,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:16,613 INFO L225 Difference]: With dead ends: 372 [2018-07-25 08:36:16,613 INFO L226 Difference]: Without dead ends: 368 [2018-07-25 08:36:16,614 INFO L574 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-25 08:36:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-07-25 08:36:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 225. [2018-07-25 08:36:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 08:36:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 702 transitions. [2018-07-25 08:36:16,736 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 702 transitions. Word has length 8 [2018-07-25 08:36:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:16,736 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 702 transitions. [2018-07-25 08:36:16,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 702 transitions. [2018-07-25 08:36:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:16,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:16,738 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:16,738 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash -518810611, now seen corresponding path program 1 times [2018-07-25 08:36:16,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:16,751 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-25 08:36:16,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:16,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:16,751 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:16,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:16,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:16,752 INFO L87 Difference]: Start difference. First operand 225 states and 702 transitions. Second operand 7 states. [2018-07-25 08:36:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:17,100 INFO L93 Difference]: Finished difference Result 389 states and 1133 transitions. [2018-07-25 08:36:17,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:17,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:17,104 INFO L225 Difference]: With dead ends: 389 [2018-07-25 08:36:17,105 INFO L226 Difference]: Without dead ends: 385 [2018-07-25 08:36:17,105 INFO L574 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-25 08:36:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-07-25 08:36:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 267. [2018-07-25 08:36:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 08:36:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 829 transitions. [2018-07-25 08:36:17,253 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 829 transitions. Word has length 8 [2018-07-25 08:36:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:17,253 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 829 transitions. [2018-07-25 08:36:17,253 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 829 transitions. [2018-07-25 08:36:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:17,254 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:17,254 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:17,255 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash -518394498, now seen corresponding path program 1 times [2018-07-25 08:36:17,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:17,267 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-25 08:36:17,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:17,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:17,268 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:17,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:17,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:17,268 INFO L87 Difference]: Start difference. First operand 267 states and 829 transitions. Second operand 7 states. [2018-07-25 08:36:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:17,712 INFO L93 Difference]: Finished difference Result 339 states and 995 transitions. [2018-07-25 08:36:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:17,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:17,716 INFO L225 Difference]: With dead ends: 339 [2018-07-25 08:36:17,717 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 08:36:17,717 INFO L574 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-25 08:36:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 08:36:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 236. [2018-07-25 08:36:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-25 08:36:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 725 transitions. [2018-07-25 08:36:17,909 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 725 transitions. Word has length 8 [2018-07-25 08:36:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:17,909 INFO L472 AbstractCegarLoop]: Abstraction has 236 states and 725 transitions. [2018-07-25 08:36:17,910 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 725 transitions. [2018-07-25 08:36:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:17,910 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:17,911 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:17,911 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1075876758, now seen corresponding path program 1 times [2018-07-25 08:36:17,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:17,920 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:17,920 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:17,920 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:36:17,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:36:17,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:36:17,921 INFO L87 Difference]: Start difference. First operand 236 states and 725 transitions. Second operand 4 states. [2018-07-25 08:36:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:18,072 INFO L93 Difference]: Finished difference Result 405 states and 1236 transitions. [2018-07-25 08:36:18,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:36:18,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-25 08:36:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:18,075 INFO L225 Difference]: With dead ends: 405 [2018-07-25 08:36:18,075 INFO L226 Difference]: Without dead ends: 218 [2018-07-25 08:36:18,076 INFO L574 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-25 08:36:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-25 08:36:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 160. [2018-07-25 08:36:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 08:36:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 459 transitions. [2018-07-25 08:36:18,194 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 459 transitions. Word has length 8 [2018-07-25 08:36:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:18,195 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 459 transitions. [2018-07-25 08:36:18,195 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:36:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 459 transitions. [2018-07-25 08:36:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:18,196 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:18,196 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:18,196 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1049947056, now seen corresponding path program 1 times [2018-07-25 08:36:18,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:18,217 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-25 08:36:18,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:18,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:18,218 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:18,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:18,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:18,219 INFO L87 Difference]: Start difference. First operand 160 states and 459 transitions. Second operand 7 states. [2018-07-25 08:36:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:18,698 INFO L93 Difference]: Finished difference Result 346 states and 967 transitions. [2018-07-25 08:36:18,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:18,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:18,702 INFO L225 Difference]: With dead ends: 346 [2018-07-25 08:36:18,702 INFO L226 Difference]: Without dead ends: 342 [2018-07-25 08:36:18,703 INFO L574 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-25 08:36:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-25 08:36:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 144. [2018-07-25 08:36:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 08:36:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 415 transitions. [2018-07-25 08:36:18,878 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 415 transitions. Word has length 8 [2018-07-25 08:36:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:18,879 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 415 transitions. [2018-07-25 08:36:18,879 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 415 transitions. [2018-07-25 08:36:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:18,880 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:18,880 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:18,880 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:18,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1049062448, now seen corresponding path program 1 times [2018-07-25 08:36:18,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:18,894 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-25 08:36:18,895 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:18,895 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:18,895 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:18,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:18,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:18,896 INFO L87 Difference]: Start difference. First operand 144 states and 415 transitions. Second operand 7 states. [2018-07-25 08:36:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:19,574 INFO L93 Difference]: Finished difference Result 316 states and 819 transitions. [2018-07-25 08:36:19,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:19,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:19,577 INFO L225 Difference]: With dead ends: 316 [2018-07-25 08:36:19,577 INFO L226 Difference]: Without dead ends: 312 [2018-07-25 08:36:19,578 INFO L574 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-25 08:36:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-07-25 08:36:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 146. [2018-07-25 08:36:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 08:36:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 423 transitions. [2018-07-25 08:36:19,765 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 423 transitions. Word has length 8 [2018-07-25 08:36:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:19,766 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 423 transitions. [2018-07-25 08:36:19,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 423 transitions. [2018-07-25 08:36:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:19,766 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:19,766 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:19,767 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:19,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1049059534, now seen corresponding path program 1 times [2018-07-25 08:36:19,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:19,782 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-25 08:36:19,782 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:19,783 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:19,783 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:19,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:19,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:19,784 INFO L87 Difference]: Start difference. First operand 146 states and 423 transitions. Second operand 7 states. [2018-07-25 08:36:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:20,415 INFO L93 Difference]: Finished difference Result 314 states and 817 transitions. [2018-07-25 08:36:20,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:20,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:20,418 INFO L225 Difference]: With dead ends: 314 [2018-07-25 08:36:20,418 INFO L226 Difference]: Without dead ends: 310 [2018-07-25 08:36:20,419 INFO L574 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-25 08:36:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-07-25 08:36:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 168. [2018-07-25 08:36:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 08:36:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 488 transitions. [2018-07-25 08:36:20,627 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 488 transitions. Word has length 8 [2018-07-25 08:36:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:20,628 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 488 transitions. [2018-07-25 08:36:20,628 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 488 transitions. [2018-07-25 08:36:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:20,629 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:20,629 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:20,630 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:20,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1046475405, now seen corresponding path program 1 times [2018-07-25 08:36:20,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:20,641 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-25 08:36:20,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:20,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:20,642 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:20,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:20,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:20,643 INFO L87 Difference]: Start difference. First operand 168 states and 488 transitions. Second operand 7 states. [2018-07-25 08:36:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:21,290 INFO L93 Difference]: Finished difference Result 315 states and 832 transitions. [2018-07-25 08:36:21,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:21,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:21,296 INFO L225 Difference]: With dead ends: 315 [2018-07-25 08:36:21,296 INFO L226 Difference]: Without dead ends: 311 [2018-07-25 08:36:21,297 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-25 08:36:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 151. [2018-07-25 08:36:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:36:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 435 transitions. [2018-07-25 08:36:21,482 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 435 transitions. Word has length 8 [2018-07-25 08:36:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:21,482 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 435 transitions. [2018-07-25 08:36:21,482 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 435 transitions. [2018-07-25 08:36:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:21,483 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:21,483 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:21,483 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:21,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1117485617, now seen corresponding path program 1 times [2018-07-25 08:36:21,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:21,496 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-25 08:36:21,496 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:21,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:21,497 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:21,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:21,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:21,497 INFO L87 Difference]: Start difference. First operand 151 states and 435 transitions. Second operand 7 states. [2018-07-25 08:36:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:22,265 INFO L93 Difference]: Finished difference Result 329 states and 898 transitions. [2018-07-25 08:36:22,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:36:22,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:22,268 INFO L225 Difference]: With dead ends: 329 [2018-07-25 08:36:22,268 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 08:36:22,269 INFO L574 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-25 08:36:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 08:36:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 173. [2018-07-25 08:36:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:36:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 504 transitions. [2018-07-25 08:36:22,505 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 504 transitions. Word has length 8 [2018-07-25 08:36:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:22,505 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 504 transitions. [2018-07-25 08:36:22,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 504 transitions. [2018-07-25 08:36:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:22,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:22,506 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:22,506 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1119667118, now seen corresponding path program 1 times [2018-07-25 08:36:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:22,518 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-25 08:36:22,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:22,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:22,518 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:22,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:22,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:22,519 INFO L87 Difference]: Start difference. First operand 173 states and 504 transitions. Second operand 7 states. [2018-07-25 08:36:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:23,178 INFO L93 Difference]: Finished difference Result 301 states and 792 transitions. [2018-07-25 08:36:23,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:23,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:23,181 INFO L225 Difference]: With dead ends: 301 [2018-07-25 08:36:23,181 INFO L226 Difference]: Without dead ends: 297 [2018-07-25 08:36:23,181 INFO L574 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-25 08:36:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-25 08:36:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 166. [2018-07-25 08:36:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 08:36:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 479 transitions. [2018-07-25 08:36:23,391 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 479 transitions. Word has length 8 [2018-07-25 08:36:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:23,392 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 479 transitions. [2018-07-25 08:36:23,392 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 479 transitions. [2018-07-25 08:36:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:36:23,392 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:23,393 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:23,393 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1119664204, now seen corresponding path program 1 times [2018-07-25 08:36:23,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:23,403 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-25 08:36:23,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:23,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:23,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:23,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:23,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:23,405 INFO L87 Difference]: Start difference. First operand 166 states and 479 transitions. Second operand 7 states. [2018-07-25 08:36:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:24,066 INFO L93 Difference]: Finished difference Result 321 states and 842 transitions. [2018-07-25 08:36:24,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:24,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-25 08:36:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:24,069 INFO L225 Difference]: With dead ends: 321 [2018-07-25 08:36:24,069 INFO L226 Difference]: Without dead ends: 317 [2018-07-25 08:36:24,070 INFO L574 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-25 08:36:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-25 08:36:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 152. [2018-07-25 08:36:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 08:36:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 428 transitions. [2018-07-25 08:36:24,288 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 428 transitions. Word has length 8 [2018-07-25 08:36:24,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:24,289 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 428 transitions. [2018-07-25 08:36:24,289 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 428 transitions. [2018-07-25 08:36:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:24,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:24,290 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:24,290 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:24,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1958270560, now seen corresponding path program 1 times [2018-07-25 08:36:24,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:24,309 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-25 08:36:24,309 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:24,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:24,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:36:24,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:36:24,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:36:24,310 INFO L87 Difference]: Start difference. First operand 152 states and 428 transitions. Second operand 4 states. [2018-07-25 08:36:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:24,605 INFO L93 Difference]: Finished difference Result 288 states and 788 transitions. [2018-07-25 08:36:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:36:24,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-25 08:36:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:24,607 INFO L225 Difference]: With dead ends: 288 [2018-07-25 08:36:24,607 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:36:24,611 INFO L574 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-25 08:36:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:36:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2018-07-25 08:36:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 08:36:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 302 transitions. [2018-07-25 08:36:24,835 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 302 transitions. Word has length 10 [2018-07-25 08:36:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:24,835 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 302 transitions. [2018-07-25 08:36:24,835 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:36:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 302 transitions. [2018-07-25 08:36:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:24,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:24,836 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:24,837 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash -161849015, now seen corresponding path program 1 times [2018-07-25 08:36:24,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:24,844 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-25 08:36:24,845 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:24,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:24,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:36:24,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:36:24,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:36:24,846 INFO L87 Difference]: Start difference. First operand 124 states and 302 transitions. Second operand 4 states. [2018-07-25 08:36:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:25,106 INFO L93 Difference]: Finished difference Result 260 states and 641 transitions. [2018-07-25 08:36:25,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:36:25,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-25 08:36:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:25,107 INFO L225 Difference]: With dead ends: 260 [2018-07-25 08:36:25,108 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:36:25,108 INFO L574 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-25 08:36:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:36:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 65. [2018-07-25 08:36:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:36:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 145 transitions. [2018-07-25 08:36:25,250 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 145 transitions. Word has length 10 [2018-07-25 08:36:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:25,250 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 145 transitions. [2018-07-25 08:36:25,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:36:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 145 transitions. [2018-07-25 08:36:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:25,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:25,251 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:25,251 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash 564711112, now seen corresponding path program 1 times [2018-07-25 08:36:25,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:25,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:25,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:25,272 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:25,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:25,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:25,273 INFO L87 Difference]: Start difference. First operand 65 states and 145 transitions. Second operand 10 states. [2018-07-25 08:36:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:25,972 INFO L93 Difference]: Finished difference Result 201 states and 440 transitions. [2018-07-25 08:36:25,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:36:25,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-07-25 08:36:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:25,975 INFO L225 Difference]: With dead ends: 201 [2018-07-25 08:36:25,975 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 08:36:25,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:36:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 08:36:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 70. [2018-07-25 08:36:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:36:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 157 transitions. [2018-07-25 08:36:26,186 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 157 transitions. Word has length 13 [2018-07-25 08:36:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:26,186 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 157 transitions. [2018-07-25 08:36:26,186 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 157 transitions. [2018-07-25 08:36:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:26,187 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:26,187 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:26,188 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash -677740153, now seen corresponding path program 1 times [2018-07-25 08:36:26,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:26,217 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:26,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:26,217 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:26,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:26,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:26,218 INFO L87 Difference]: Start difference. First operand 70 states and 157 transitions. Second operand 10 states. [2018-07-25 08:36:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:27,190 INFO L93 Difference]: Finished difference Result 197 states and 439 transitions. [2018-07-25 08:36:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:36:27,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-07-25 08:36:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:27,193 INFO L225 Difference]: With dead ends: 197 [2018-07-25 08:36:27,193 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 08:36:27,194 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:36:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 08:36:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 67. [2018-07-25 08:36:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:36:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 151 transitions. [2018-07-25 08:36:27,386 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 151 transitions. Word has length 13 [2018-07-25 08:36:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:27,386 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 151 transitions. [2018-07-25 08:36:27,386 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 151 transitions. [2018-07-25 08:36:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:27,387 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:27,387 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:27,387 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash -599447802, now seen corresponding path program 1 times [2018-07-25 08:36:27,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:27,415 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-25 08:36:27,415 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:27,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:27,416 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:27,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:27,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:27,417 INFO L87 Difference]: Start difference. First operand 67 states and 151 transitions. Second operand 11 states. [2018-07-25 08:36:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:28,488 INFO L93 Difference]: Finished difference Result 179 states and 401 transitions. [2018-07-25 08:36:28,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:36:28,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-07-25 08:36:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:28,489 INFO L225 Difference]: With dead ends: 179 [2018-07-25 08:36:28,490 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 08:36:28,491 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:36:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 08:36:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 08:36:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 08:36:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 08:36:28,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-07-25 08:36:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:28,492 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 08:36:28,492 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 08:36:28,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 08:36:28,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 08:36:29,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:33,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:34,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:34,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:34,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:34,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:36,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:37,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:37,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:37,404 WARN L169 SmtUtils]: Spent 8.89 s on a formula simplification. DAG size of input: 665 DAG size of output: 476 [2018-07-25 08:36:37,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:37,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:38,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:38,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:38,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:39,060 WARN L169 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 575 DAG size of output: 432 [2018-07-25 08:36:39,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:39,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:39,196 WARN L169 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 141 [2018-07-25 08:36:39,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:39,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:39,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:39,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:39,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:39,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,076 WARN L169 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 573 DAG size of output: 427 [2018-07-25 08:36:40,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:40,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:41,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:41,473 WARN L169 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 764 DAG size of output: 550 [2018-07-25 08:36:41,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:41,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:41,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:41,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:41,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:41,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:41,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:42,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:42,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:43,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:43,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:43,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:44,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:44,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:44,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:44,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:44,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:44,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:44,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,653 WARN L169 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 1006 DAG size of output: 723 [2018-07-25 08:36:45,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:45,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:46,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:46,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:46,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:46,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,273 WARN L169 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 670 DAG size of output: 488 [2018-07-25 08:36:47,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:47,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:48,272 WARN L169 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 513 DAG size of output: 356 [2018-07-25 08:36:48,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:48,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:48,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:48,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:48,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:49,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:36:51,935 WARN L169 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 655 DAG size of output: 522 [2018-07-25 08:36:59,041 WARN L169 SmtUtils]: Spent 7.10 s on a formula simplification. DAG size of input: 465 DAG size of output: 50 [2018-07-25 08:37:01,420 WARN L169 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 394 DAG size of output: 43 [2018-07-25 08:37:01,701 WARN L169 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 39 [2018-07-25 08:37:03,157 WARN L169 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 394 DAG size of output: 79 [2018-07-25 08:37:05,615 WARN L169 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 504 DAG size of output: 84 [2018-07-25 08:37:09,078 WARN L169 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 692 DAG size of output: 79 [2018-07-25 08:37:10,372 WARN L169 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 462 DAG size of output: 55 [2018-07-25 08:37:11,095 WARN L169 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 51 [2018-07-25 08:37:13,526 WARN L169 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 501 DAG size of output: 54 [2018-07-25 08:37:13,531 INFO L418 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_working_1 2)) (.cse20 (+ product__local__threadpooling_working_0 1)) (.cse19 (+ product__local__threadpooling_end_1 1)) (.cse21 (+ product__local__threadpooling_i_0 1)) (.cse1 (+ product__local__threadpooling_end_0 1))) (let ((.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= (+ product__local__threadpooling_working_1 1) product__global_next)) (.cse8 (<= .cse1 product__global_next)) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse15 (<= .cse21 product__local__threadpooling_end_0)) (.cse18 (<= .cse19 product__local__threadpooling_working_0)) (.cse12 (<= .cse19 product__local__threadpooling_i_0)) (.cse17 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse2 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse14 (= product__local__threadpooling_end_0 product__global_next)) (.cse6 (<= product__local__threadpooling_end_0 .cse21)) (.cse5 (<= .cse20 product__global_next)) (.cse7 (<= .cse20 product__local__threadpooling_i_1)) (.cse13 (<= .cse10 product__global_next))) (or (let ((.cse9 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (or (and .cse0 (and (and (<= .cse1 product__local__threadpooling_i_1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) .cse8)) (and (and (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse3 .cse6 (= product__local__threadpooling_i_1 product__local__threadpooling_end_0)) .cse0 .cse9 .cse8) (and (and (or (and (<= .cse10 product__local__threadpooling_i_0) .cse6 (and .cse11 .cse12)) (and .cse6 (and .cse11 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse13)) .cse14 .cse9) .cse0 .cse15))) (let ((.cse16 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and .cse0 (and (and .cse11 .cse3) .cse16 .cse4 .cse5 .cse7) .cse8) (and .cse0 (and (= product__global_next product__local__threadpooling_end_0) (or (and .cse2 .cse16 .cse17) (and .cse16 .cse11 .cse18)) .cse5) (<= .cse10 product__local__threadpooling_end_0)))) (and (and .cse0 .cse15 (or (and (or (and .cse2 .cse18) (and .cse2 .cse12 .cse17)) .cse5 .cse14 .cse6) (and .cse2 (and (<= .cse19 product__local__threadpooling_end_0) .cse14 .cse6) .cse5 .cse7))) .cse13)))) [2018-07-25 08:37:13,532 INFO L418 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse11 (+ product__local__threadpooling_working_0 1))) (let ((.cse7 (<= .cse11 product__local__threadpooling_i_1)) (.cse3 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse2 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse6 (<= .cse11 product__global_next)) (.cse8 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1)))) (or (and (let ((.cse1 (+ product__local__threadpooling_working_0 2))) (let ((.cse0 (let ((.cse4 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse5 (<= .cse1 product__local__threadpooling_working_1)))))) (or (and .cse0 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (and .cse0 (<= .cse1 product__global_next))))) .cse8) (and (let ((.cse10 (+ product__local__threadpooling_end_1 1))) (let ((.cse9 (and (<= .cse10 product__local__threadpooling_end_0) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (<= .cse10 product__local__threadpooling_i_0)))) (or (and .cse3 .cse6 .cse9 .cse7) (and .cse3 (or (and .cse2 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (and .cse9 (<= .cse10 product__local__threadpooling_working_0))) .cse6)))) .cse8 (= product__local__threadpooling_end_0 product__global_next) (<= (+ product__local__threadpooling_working_1 2) product__global_next))))) [2018-07-25 08:37:13,533 INFO L418 ceAbstractionStarter]: At program point productErr2ASSERT_VIOLATIONASSERT(line 171) the Hoare annotation is: false [2018-07-25 08:37:13,534 INFO L418 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse25 (+ product__local__threadpooling_working_1 2))) (let ((.cse22 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse20 (<= .cse25 product__local__threadpooling_i_0))) (let ((.cse10 (<= .cse25 product__local__threadpooling_working_0)) (.cse15 (and .cse22 .cse20)) (.cse9 (<= .cse25 product__global_next)) (.cse23 (= product__local__threadpooling_end_1 product__global_next)) (.cse21 (+ product__local__threadpooling_working_1 1)) (.cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse24 (+ product__local__threadpooling_working_0 1))) (let ((.cse8 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0)) (.cse11 (= product__local__threadpooling_end_0 product__global_next)) (.cse7 (<= .cse24 product__local__threadpooling_i_1)) (.cse3 (and .cse23 (<= .cse21 product__global_next) .cse2)) (.cse6 (<= .cse24 product__global_next)) (.cse1 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse5 (or (and .cse10 .cse15 .cse9) (and (<= .cse21 product__local__threadpooling_i_0) (and .cse22 .cse23) .cse9)))) (or (let ((.cse0 (let ((.cse4 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and (or (and .cse3 .cse4) (and .cse4 .cse5)) .cse6 .cse7) (and (or (and .cse8 .cse9) .cse10) .cse4 .cse6 .cse11))))) (or (and .cse0 .cse1) (and (= product__global_next product__local__threadpooling_end_0) .cse0 .cse2))) (let ((.cse19 (+ product__local__threadpooling_i_0 1))) (let ((.cse16 (<= product__local__threadpooling_end_0 .cse19)) (.cse13 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (let ((.cse17 (and .cse20 .cse13)) (.cse12 (and .cse16 .cse5)) (.cse14 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse18 (<= .cse19 product__local__threadpooling_end_0))) (or (and (and (and .cse12 .cse13) .cse1) .cse14) (and (or (and (or (and (and .cse8 .cse2) .cse9) .cse15) .cse6 .cse16) (and .cse17 .cse16)) .cse11 .cse18) (and (and (or (and (and (= product__global_next product__local__threadpooling_end_1) .cse17) .cse16) (and .cse6 .cse12 .cse7) (and (and .cse3 .cse6 .cse16) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)))) .cse1) .cse14 .cse18)))))))))) [2018-07-25 08:37:13,534 INFO L425 ceAbstractionStarter]: At program point productENTRY(lines 3 236) the Hoare annotation is: true [2018-07-25 08:37:13,534 INFO L422 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-07-25 08:37:13,535 INFO L418 ceAbstractionStarter]: At program point productErr5ASSERT_VIOLATIONASSERT(line 186) the Hoare annotation is: false [2018-07-25 08:37:13,535 INFO L422 ceAbstractionStarter]: For program point L119(lines 119 124) no Hoare annotation was computed. [2018-07-25 08:37:13,535 INFO L422 ceAbstractionStarter]: For program point L95(lines 95 190) no Hoare annotation was computed. [2018-07-25 08:37:13,536 INFO L418 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_i_0 1)) (.cse3 (+ product__local__threadpooling_working_0 1))) (let ((.cse1 (<= .cse3 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse4 (<= .cse5 product__local__threadpooling_end_0)) (.cse2 (<= product__local__threadpooling_end_0 .cse5))) (or (and .cse0 (and (and .cse1 (and (and (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_1 1) product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) .cse2) (<= .cse3 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse4) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1 .cse0 (= product__local__threadpooling_end_0 product__global_next) .cse4 (or (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse2) (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse2)) (<= (+ product__local__threadpooling_working_1 2) product__global_next))))) [2018-07-25 08:37:13,536 INFO L422 ceAbstractionStarter]: For program point L154(lines 154 159) no Hoare annotation was computed. [2018-07-25 08:37:13,537 INFO L418 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse1 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (let ((.cse0 (let ((.cse10 (+ product__local__threadpooling_working_1 1)) (.cse13 (+ product__local__threadpooling_working_1 2))) (let ((.cse4 (<= .cse13 product__global_next)) (.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= .cse10 product__global_next))) (or (or (and .cse2 .cse3 .cse1) (and .cse1 .cse4)) (let ((.cse9 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (+ product__local__threadpooling_working_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (<= .cse8 product__global_next)) (.cse7 (let ((.cse12 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)))) (or (and (<= .cse10 product__local__threadpooling_i_0) (or (and (let ((.cse11 (+ product__local__threadpooling_end_1 1))) (and (<= .cse11 product__local__threadpooling_end_0) .cse12 (<= .cse11 product__local__threadpooling_i_0) .cse9)) .cse4) (and (<= .cse13 product__local__threadpooling_working_0) (<= .cse13 product__local__threadpooling_i_0) .cse4))) (and .cse12 .cse2 .cse3))))) (or (and .cse5 .cse6 .cse7 (<= .cse8 product__local__threadpooling_i_1)) (and .cse5 .cse6 .cse7 .cse9))))))))) (or (and .cse0 .cse1) (and .cse0 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (and (= product__global_next product__local__threadpooling_end_0) .cse0)))) [2018-07-25 08:37:13,537 INFO L422 ceAbstractionStarter]: For program point L196(lines 196 201) no Hoare annotation was computed. [2018-07-25 08:37:13,537 INFO L418 ceAbstractionStarter]: At program point productErr4ASSERT_VIOLATIONASSERT(line 181) the Hoare annotation is: false [2018-07-25 08:37:13,537 INFO L422 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-07-25 08:37:13,538 INFO L418 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_i_0 1)) (.cse11 (+ product__local__threadpooling_working_1 2))) (let ((.cse8 (<= .cse11 product__local__threadpooling_working_0)) (.cse6 (+ product__local__threadpooling_working_1 1)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse5 (<= product__local__threadpooling_end_0 .cse10))) (let ((.cse2 (or (and (and .cse8 (<= .cse11 product__local__threadpooling_i_0) (<= .cse11 product__global_next)) .cse5) (and (and (<= .cse6 product__global_next) (and (= product__local__threadpooling_end_1 product__global_next) .cse7)) .cse5))) (.cse1 (<= (+ product__local__threadpooling_end_0 1) product__global_next)) (.cse9 (<= .cse10 product__local__threadpooling_end_0))) (or (and (let ((.cse0 (let ((.cse4 (+ product__local__threadpooling_working_0 1))) (let ((.cse3 (<= .cse4 product__global_next))) (or (and .cse2 .cse3 (<= .cse4 product__local__threadpooling_i_1)) (and (and .cse3 .cse5 (or (and (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_end_0) (<= .cse6 product__local__threadpooling_i_0) .cse7) .cse8)) (= product__local__threadpooling_end_0 product__global_next))))))) (or (and .cse0 .cse1) (and (= product__global_next product__local__threadpooling_end_0) .cse0))) .cse9) (and (and (and (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse2) .cse1) (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1) .cse9))))) [2018-07-25 08:37:13,539 INFO L418 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse8 (+ product__local__threadpooling_i_0 1)) (.cse4 (+ product__local__threadpooling_working_0 1))) (let ((.cse1 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse2 (<= .cse4 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= product__local__threadpooling_end_0 .cse8)) (.cse5 (<= .cse8 product__local__threadpooling_end_0)) (.cse6 (<= (+ product__local__threadpooling_working_1 2) product__global_next))) (or (or (and .cse0 (and (and .cse1 (= product__local__threadpooling_end_1 product__global_next) (<= (+ product__local__threadpooling_working_1 1) product__global_next) .cse2 .cse3 (<= .cse4 product__local__threadpooling_i_1)) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse5) (and .cse2 .cse0 (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse3 .cse6) .cse7)) (and .cse1 .cse2 .cse0 .cse7 .cse3 (<= (+ product__local__threadpooling_end_1 1) product__local__threadpooling_working_0) .cse5 .cse6)))) [2018-07-25 08:37:13,539 INFO L418 ceAbstractionStarter]: At program point productErr1ASSERT_VIOLATIONASSERT(line 82) the Hoare annotation is: false [2018-07-25 08:37:13,539 INFO L418 ceAbstractionStarter]: At program point productErr0ASSERT_VIOLATIONASSERT(line 60) the Hoare annotation is: false [2018-07-25 08:37:13,540 INFO L418 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_working_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse3 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (<= .cse10 product__global_next)) (.cse4 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse9 (<= .cse10 product__local__threadpooling_i_1)) (.cse8 (<= (+ product__local__threadpooling_working_1 2) product__global_next))) (or (and (let ((.cse1 (+ product__local__threadpooling_working_0 2))) (and (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= (+ product__local__threadpooling_working_1 1) product__global_next))) (or (and (and .cse0 (<= .cse1 product__local__threadpooling_i_1)) .cse2) (and .cse3 (and .cse4 .cse0 .cse2)))) (<= .cse1 product__global_next))) .cse5) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse5 (and (= product__global_next product__local__threadpooling_end_0) (let ((.cse7 (+ product__local__threadpooling_end_1 1))) (or (and .cse3 .cse6 (and (or (<= .cse7 product__local__threadpooling_working_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse8)) (and .cse3 .cse6 (and (<= .cse7 product__local__threadpooling_end_0) .cse8) .cse9))))) (and (and .cse5 (and .cse3 .cse6 (and (= product__global_next product__local__threadpooling_end_1) .cse4) .cse9) (<= (+ product__local__threadpooling_end_0 1) product__global_next)) .cse8)))) [2018-07-25 08:37:13,540 INFO L422 ceAbstractionStarter]: For program point L207(lines 207 212) no Hoare annotation was computed. [2018-07-25 08:37:13,542 INFO L418 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse17 (+ product__local__threadpooling_end_0 1)) (.cse20 (+ product__local__threadpooling_i_0 1)) (.cse21 (+ product__local__threadpooling_working_0 2)) (.cse23 (+ product__local__threadpooling_working_0 1)) (.cse13 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse18 (= product__local__threadpooling_end_1 product__global_next)) (.cse19 (+ product__local__threadpooling_working_1 1)) (.cse22 (+ product__local__threadpooling_working_1 2)) (.cse12 (+ product__local__threadpooling_end_1 1))) (let ((.cse14 (<= .cse12 product__local__threadpooling_working_0)) (.cse7 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse15 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse6 (= product__local__threadpooling_end_0 product__global_next)) (.cse16 (<= .cse22 product__global_next)) (.cse4 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse8 (and .cse13 .cse18 (<= .cse19 product__global_next))) (.cse9 (<= .cse23 product__global_next)) (.cse2 (<= .cse21 product__global_next)) (.cse10 (<= .cse23 product__local__threadpooling_i_1)) (.cse0 (<= .cse22 product__local__threadpooling_i_0)) (.cse1 (<= .cse21 product__local__threadpooling_i_1)) (.cse3 (<= product__local__threadpooling_end_0 .cse20)) (.cse11 (<= .cse17 product__global_next)) (.cse5 (<= .cse20 product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (and (and (and .cse0 .cse1 .cse2) .cse3) .cse4 .cse5)) .cse6) (and (and (and .cse7 .cse8) .cse9 .cse10) .cse4 .cse11) (and (and .cse4 (and (= product__global_next product__local__threadpooling_end_0) (or (and .cse9 (and (<= .cse12 product__local__threadpooling_end_0) .cse13 .cse3) .cse10) (and .cse9 (or (and .cse13 .cse14) (and .cse13 (<= .cse12 product__local__threadpooling_i_0) .cse15)) .cse3))) .cse5) .cse16) (and .cse9 .cse4 (or (and .cse7 .cse13 .cse6 .cse14) (and .cse7 .cse13 .cse15 .cse6)) .cse16) (and .cse4 (or (and (and (<= .cse17 product__local__threadpooling_i_1) (or (and (and .cse8 .cse9 .cse3 .cse10) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (and (and .cse0 .cse18 .cse2) .cse3))) .cse11) (and (and (or (and .cse3 (and .cse13 .cse18 (<= .cse19 product__local__threadpooling_i_0)) .cse10) (and (and .cse0 .cse18 .cse1) .cse3)) (= product__local__threadpooling_i_1 product__local__threadpooling_end_0)) .cse11)) .cse5)))) [2018-07-25 08:37:13,542 INFO L418 ceAbstractionStarter]: At program point productErr3ASSERT_VIOLATIONASSERT(line 176) the Hoare annotation is: false [2018-07-25 08:37:13,542 INFO L422 ceAbstractionStarter]: For program point L43(lines 43 48) no Hoare annotation was computed. [2018-07-25 08:37:13,580 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:37:13 BoogieIcfgContainer [2018-07-25 08:37:13,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:37:13,581 INFO L168 Benchmark]: Toolchain (without parser) took 63748.90 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -793.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-07-25 08:37:13,582 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-25 08:37:13,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.99 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-25 08:37:13,583 INFO L168 Benchmark]: Boogie Preprocessor took 26.11 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-25 08:37:13,584 INFO L168 Benchmark]: RCFGBuilder took 301.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:37:13,585 INFO L168 Benchmark]: TraceAbstraction took 63368.58 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -804.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-07-25 08:37:13,588 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.24 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 Procedure Inliner took 47.99 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 26.11 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 301.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63368.58 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -804.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 60]: 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 - PositiveResult [Line: 176]: 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: 186]: 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: 97]: Loop Invariant Derived loop invariant: (((((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) || (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next)))) && _local__threadpooling_working_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 + 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_0 + 1 <= _global_next) || ((_global_next == _local__threadpooling_end_0 && (((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) || (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next)))) && _local__threadpooling_working_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 + 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_working_0 == _local__threadpooling_working_1))) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next))) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) || ((((((((_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 == _local__threadpooling_working_0) && _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_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _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_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _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 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 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_1 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _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_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_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _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_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next)) && _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_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _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_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_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _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_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_end_0 + 1 <= _global_next)) || (_global_next == _local__threadpooling_end_0 && ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (_local__threadpooling_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _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_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_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && ((_local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0 && (((((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _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_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next))) && _local__threadpooling_end_0 == _global_next))) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _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_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_end_1 + 1 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 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 + 2 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _global_next == _local__threadpooling_end_0 && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0 || _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _global_next) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _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_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && _global_next == _local__threadpooling_end_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && ((_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_0 == _global_next)) || (((((((!(_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 <= _global_next) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && ((((_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) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_end_0 == _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 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 + 1 <= _global_next)) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _global_next == _local__threadpooling_end_0 && (((_local__threadpooling_working_0 + 1 <= _global_next && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || ((_local__threadpooling_working_0 + 1 <= _global_next && ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0))) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next)) || (((_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)) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (((_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_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) || (((_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_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_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 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_i_1 == _local__threadpooling_end_0) && _local__threadpooling_end_0 + 1 <= _global_next))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && ((_local__threadpooling_end_0 + 1 <= _local__threadpooling_i_1 && ((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 + 1 <= _global_next) || ((((((_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_i_1 == _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 + 1 <= _global_next)) || (((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _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_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_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _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_1 + 1 && ((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 + 1 <= _global_next) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (_global_next == _local__threadpooling_end_0 && (((!(_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_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0))) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_end_0)) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_working_0) || ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1))) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_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_end_0 + 1 <= _global_next) || (((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_working_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_0 + 2 <= _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || (((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_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_0 <= _local__threadpooling_i_0 && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_working_0) || (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 + 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_working_1 + 2 <= _global_next) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((_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_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0)) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_end_0 + 1 <= _global_next) || (_global_next == _local__threadpooling_end_0 && (((((((_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_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_i_1) || (((_local__threadpooling_working_0 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (((_local__threadpooling_end_1 + 1 <= _local__threadpooling_end_0 && _local__threadpooling_working_1 + 1 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) || _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0)) && _local__threadpooling_end_0 == _global_next)))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_working_0 + 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_1 + 1 <= _global_next && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _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, 63.2s OverallTime, 30 OverallIterations, 2 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 45.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1393 SDtfs, 3055 SDslu, 1633 SDs, 0 SdLazy, 13797 SolverSat, 1756 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 2901 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 189 NumberOfFragments, 2501 HoareAnnotationTreeSize, 16 FomulaSimplifications, 7180967160426309022 FormulaSimplificationTreeSizeReduction, 23.4s HoareSimplificationTime, 16 FomulaSimplificationsInter, 122173963469419134 FormulaSimplificationTreeSizeReductionInter, 21.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 6779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 16/66 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_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-37-13-607.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-37-13-607.csv Received shutdown request...