java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:07:43,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:07:43,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:07:43,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:07:43,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:07:43,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:07:43,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:07:43,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:07:43,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:07:43,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:07:43,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:07:43,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:07:43,339 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:07:43,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:07:43,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:07:43,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:07:43,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:07:43,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:07:43,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:07:43,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:07:43,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:07:43,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:07:43,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:07:43,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:07:43,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:07:43,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:07:43,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:07:43,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:07:43,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:07:43,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:07:43,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:07:43,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:07:43,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:07:43,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:07:43,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:07:43,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:07:43,372 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:07:43,385 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:07:43,385 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:07:43,387 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:07:43,388 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:07:43,388 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:07:43,388 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:07:43,388 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:07:43,388 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:07:43,389 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:07:43,390 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:07:43,390 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:07:43,390 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:07:43,390 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:07:43,391 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:07:43,391 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:07:43,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:07:43,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:07:43,394 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:07:43,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:07:43,395 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:07:43,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:07:43,395 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:07:43,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:07:43,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:07:43,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:07:43,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:07:43,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:07:43,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:07:43,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:07:43,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:07:43,399 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:07:43,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:07:43,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:43,399 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:07:43,399 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:07:43,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:07:43,400 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:07:43,400 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:07:43,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:07:43,400 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:07:43,401 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:07:43,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:07:43,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:07:43,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:07:43,481 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:07:43,482 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:07:43,483 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-12-03 15:07:43,484 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-12-03 15:07:43,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:07:43,542 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:07:43,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:43,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:07:43,544 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:07:43,563 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 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,577 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 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,586 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:07:43,587 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:07:43,587 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:07:43,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:43,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:07:43,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:07:43,592 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:07:43,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/1) ... [2018-12-03 15:07:43,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:07:43,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:07:43,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:07:43,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:07:43,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:43,708 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 15:07:43,708 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 15:07:43,708 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 15:07:44,261 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:07:44,261 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:07:44,262 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:44 BoogieIcfgContainer [2018-12-03 15:07:44,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:07:44,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:07:44,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:07:44,267 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:07:44,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:43" (1/2) ... [2018-12-03 15:07:44,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636da5f1 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:07:44, skipping insertion in model container [2018-12-03 15:07:44,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:44" (2/2) ... [2018-12-03 15:07:44,271 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-12-03 15:07:44,282 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:07:44,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-03 15:07:44,310 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-03 15:07:44,347 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:07:44,347 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:07:44,348 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:07:44,348 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:07:44,348 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:07:44,348 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:07:44,348 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:07:44,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:07:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-03 15:07:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:07:44,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:44,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:07:44,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:44,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:44,383 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-12-03 15:07:44,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:44,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:44,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:44,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:44,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:44,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:44,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:07:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:07:44,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:44,638 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-12-03 15:07:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:45,455 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-12-03 15:07:45,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:07:45,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:07:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:45,473 INFO L225 Difference]: With dead ends: 46 [2018-12-03 15:07:45,473 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:07:45,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:07:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-12-03 15:07:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:07:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-12-03 15:07:45,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-12-03 15:07:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:45,524 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-12-03 15:07:45,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:07:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-12-03 15:07:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:07:45,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:45,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:07:45,527 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:45,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-12-03 15:07:45,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:45,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:45,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:45,770 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-12-03 15:07:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:45,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:45,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:45,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:45,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:07:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:07:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:45,873 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-12-03 15:07:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:46,939 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-12-03 15:07:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:07:46,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:07:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:46,942 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:07:46,942 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:07:46,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:07:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:07:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-12-03 15:07:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:07:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-12-03 15:07:46,968 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-12-03 15:07:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:46,969 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-12-03 15:07:46,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:07:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-12-03 15:07:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:07:46,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:46,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:46,972 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:46,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-12-03 15:07:46,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:47,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:47,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 15:07:47,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:47,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:47,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:47,118 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-12-03 15:07:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:48,633 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-12-03 15:07:48,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:07:48,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:07:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:48,637 INFO L225 Difference]: With dead ends: 198 [2018-12-03 15:07:48,637 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 15:07:48,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:07:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 15:07:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-12-03 15:07:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 15:07:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-12-03 15:07:48,669 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-12-03 15:07:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:48,671 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-12-03 15:07:48,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-12-03 15:07:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:07:48,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:48,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:48,673 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:48,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-12-03 15:07:48,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:48,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:48,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:48,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:48,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:48,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:48,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 15:07:48,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:48,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:48,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:48,834 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-12-03 15:07:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:49,951 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-12-03 15:07:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:07:49,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:07:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:49,956 INFO L225 Difference]: With dead ends: 227 [2018-12-03 15:07:49,956 INFO L226 Difference]: Without dead ends: 223 [2018-12-03 15:07:49,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:07:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-03 15:07:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-12-03 15:07:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:07:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-12-03 15:07:49,989 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-12-03 15:07:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:49,989 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-12-03 15:07:49,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-12-03 15:07:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:07:49,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:49,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:49,991 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:49,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-12-03 15:07:49,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:49,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:49,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:49,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:49,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 15:07:50,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:50,082 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-12-03 15:07:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:51,859 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-12-03 15:07:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:07:51,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:07:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:51,863 INFO L225 Difference]: With dead ends: 286 [2018-12-03 15:07:51,863 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 15:07:51,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:07:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 15:07:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-12-03 15:07:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 15:07:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-12-03 15:07:51,910 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-12-03 15:07:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:51,910 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-12-03 15:07:51,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-12-03 15:07:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:07:51,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:51,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:51,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:51,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-12-03 15:07:51,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:51,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:51,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:52,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:52,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 15:07:52,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:52,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:52,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:52,024 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-12-03 15:07:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:54,182 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-12-03 15:07:54,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:07:54,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:07:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:54,185 INFO L225 Difference]: With dead ends: 351 [2018-12-03 15:07:54,185 INFO L226 Difference]: Without dead ends: 347 [2018-12-03 15:07:54,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:07:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-03 15:07:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-12-03 15:07:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 15:07:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-12-03 15:07:54,238 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-12-03 15:07:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:54,239 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-12-03 15:07:54,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-12-03 15:07:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:07:54,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:54,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:54,241 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:54,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:54,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-12-03 15:07:54,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:54,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:54,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:54,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:54,487 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-12-03 15:07:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:54,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:54,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 15:07:54,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:54,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:54,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:54,552 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-12-03 15:07:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:55,819 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-12-03 15:07:55,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:07:55,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:07:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:55,824 INFO L225 Difference]: With dead ends: 353 [2018-12-03 15:07:55,824 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 15:07:55,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:07:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 15:07:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-12-03 15:07:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 15:07:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-12-03 15:07:55,871 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-12-03 15:07:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:55,871 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-12-03 15:07:55,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-12-03 15:07:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:07:55,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:55,873 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 15:07:55,873 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:55,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-12-03 15:07:55,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:55,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:55,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:55,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:55,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:55,928 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:07:55,929 INFO L205 CegarAbsIntRunner]: [0], [57], [61], [95], [96], [120] [2018-12-03 15:07:55,969 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:55,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:56,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:56,062 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:07:56,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:56,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:56,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:56,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:07:56,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:56,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:56,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:56,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:56,638 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:07:56,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2018-12-03 15:07:56,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:56,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:07:56,640 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 4 states. [2018-12-03 15:07:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:57,136 INFO L93 Difference]: Finished difference Result 373 states and 895 transitions. [2018-12-03 15:07:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:07:57,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 15:07:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:57,139 INFO L225 Difference]: With dead ends: 373 [2018-12-03 15:07:57,139 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 15:07:57,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:07:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 15:07:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-03 15:07:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 15:07:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-12-03 15:07:57,202 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-12-03 15:07:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:57,202 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-12-03 15:07:57,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-12-03 15:07:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:07:57,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:57,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:57,204 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:57,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-12-03 15:07:57,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:57,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:57,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:57,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:57,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:57,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 15:07:57,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:57,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:07:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:07:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:07:57,343 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-12-03 15:07:58,246 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 15:07:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:59,698 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-12-03 15:07:59,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:07:59,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-03 15:07:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:59,701 INFO L225 Difference]: With dead ends: 383 [2018-12-03 15:07:59,701 INFO L226 Difference]: Without dead ends: 379 [2018-12-03 15:07:59,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:07:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-12-03 15:07:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-12-03 15:07:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-12-03 15:07:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-12-03 15:07:59,768 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-12-03 15:07:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:59,769 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-12-03 15:07:59,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:07:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-12-03 15:07:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:07:59,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:59,770 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:59,770 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:59,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-12-03 15:07:59,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:59,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:59,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:59,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:59,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:59,940 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 15:07:59,940 INFO L205 CegarAbsIntRunner]: [0], [7], [76], [80], [86], [102], [104], [106], [117] [2018-12-03 15:07:59,941 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:59,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:59,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:59,954 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:07:59,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:59,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:59,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:59,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:07:59,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:59,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:59,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:00,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:00,032 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:08:00,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-12-03 15:08:00,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:00,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:08:00,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:08:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:00,033 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 3 states. [2018-12-03 15:08:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:00,311 INFO L93 Difference]: Finished difference Result 475 states and 1089 transitions. [2018-12-03 15:08:00,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:08:00,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 15:08:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:00,314 INFO L225 Difference]: With dead ends: 475 [2018-12-03 15:08:00,314 INFO L226 Difference]: Without dead ends: 226 [2018-12-03 15:08:00,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:08:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-03 15:08:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-12-03 15:08:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 15:08:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 447 transitions. [2018-12-03 15:08:00,395 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 447 transitions. Word has length 10 [2018-12-03 15:08:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:00,395 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 447 transitions. [2018-12-03 15:08:00,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:08:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 447 transitions. [2018-12-03 15:08:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:00,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:00,396 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:00,397 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:00,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-12-03 15:08:00,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:00,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:00,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:00,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:00,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:08:00,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:00,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:08:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:08:00,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:08:00,539 INFO L87 Difference]: Start difference. First operand 225 states and 447 transitions. Second operand 4 states. [2018-12-03 15:08:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:01,038 INFO L93 Difference]: Finished difference Result 386 states and 760 transitions. [2018-12-03 15:08:01,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:08:01,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 15:08:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:01,040 INFO L225 Difference]: With dead ends: 386 [2018-12-03 15:08:01,040 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 15:08:01,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:08:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 15:08:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2018-12-03 15:08:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 15:08:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 334 transitions. [2018-12-03 15:08:01,106 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 334 transitions. Word has length 11 [2018-12-03 15:08:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:01,107 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 334 transitions. [2018-12-03 15:08:01,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:08:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 334 transitions. [2018-12-03 15:08:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:01,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:01,108 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:01,108 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:01,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-12-03 15:08:01,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:01,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:01,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:01,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:01,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:01,743 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:01,743 INFO L205 CegarAbsIntRunner]: [0], [7], [15], [17], [19], [26], [92], [102], [106], [117] [2018-12-03 15:08:01,744 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:01,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:01,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:01,778 INFO L272 AbstractInterpreter]: Visited 10 different actions 18 times. Merged at 7 different actions 7 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:01,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:01,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:01,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:01,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:01,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:01,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:01,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:01,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:01,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:01,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-12-03 15:08:01,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:01,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:08:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:08:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:08:01,985 INFO L87 Difference]: Start difference. First operand 182 states and 334 transitions. Second operand 12 states. [2018-12-03 15:08:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:03,881 INFO L93 Difference]: Finished difference Result 261 states and 443 transitions. [2018-12-03 15:08:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:08:03,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 15:08:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:03,883 INFO L225 Difference]: With dead ends: 261 [2018-12-03 15:08:03,883 INFO L226 Difference]: Without dead ends: 257 [2018-12-03 15:08:03,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=1071, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:08:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-03 15:08:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 128. [2018-12-03 15:08:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 15:08:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 225 transitions. [2018-12-03 15:08:03,943 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 225 transitions. Word has length 11 [2018-12-03 15:08:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:03,943 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 225 transitions. [2018-12-03 15:08:03,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:08:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 225 transitions. [2018-12-03 15:08:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:08:03,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:03,944 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:03,945 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:03,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-12-03 15:08:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:03,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:03,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:03,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:04,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:04,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:04,310 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-03 15:08:04,311 INFO L205 CegarAbsIntRunner]: [0], [35], [44], [53], [57], [59], [61], [96], [98], [120] [2018-12-03 15:08:04,312 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:04,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:04,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:04,340 INFO L272 AbstractInterpreter]: Visited 10 different actions 18 times. Merged at 7 different actions 7 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:04,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:04,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:04,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:04,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:04,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:04,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:04,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:04,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:04,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:04,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2018-12-03 15:08:04,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:04,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:08:04,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:08:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:08:04,684 INFO L87 Difference]: Start difference. First operand 128 states and 225 transitions. Second operand 13 states. [2018-12-03 15:08:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:05,981 INFO L93 Difference]: Finished difference Result 238 states and 399 transitions. [2018-12-03 15:08:05,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:08:05,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-12-03 15:08:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:05,983 INFO L225 Difference]: With dead ends: 238 [2018-12-03 15:08:05,983 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 15:08:05,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:08:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 15:08:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 81. [2018-12-03 15:08:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:08:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 139 transitions. [2018-12-03 15:08:06,024 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 139 transitions. Word has length 11 [2018-12-03 15:08:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:06,024 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 139 transitions. [2018-12-03 15:08:06,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:08:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 139 transitions. [2018-12-03 15:08:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:08:06,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:06,025 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:06,025 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:06,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash -442294699, now seen corresponding path program 1 times [2018-12-03 15:08:06,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:06,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:06,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:06,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:06,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:06,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:06,284 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 15:08:06,284 INFO L205 CegarAbsIntRunner]: [0], [7], [76], [80], [86], [93], [102], [104], [106], [117] [2018-12-03 15:08:06,286 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:06,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:06,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:06,304 INFO L272 AbstractInterpreter]: Visited 10 different actions 14 times. Merged at 3 different actions 3 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:06,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:06,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:06,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:06,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:06,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:06,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:06,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:06,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:06,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:06,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2018-12-03 15:08:06,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:06,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:08:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:08:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:08:06,457 INFO L87 Difference]: Start difference. First operand 81 states and 139 transitions. Second operand 10 states. [2018-12-03 15:08:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:07,425 INFO L93 Difference]: Finished difference Result 229 states and 380 transitions. [2018-12-03 15:08:07,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:08:07,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-03 15:08:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:07,427 INFO L225 Difference]: With dead ends: 229 [2018-12-03 15:08:07,427 INFO L226 Difference]: Without dead ends: 225 [2018-12-03 15:08:07,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:08:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-12-03 15:08:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-12-03 15:08:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:08:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-12-03 15:08:07,471 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 13 [2018-12-03 15:08:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:07,471 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-12-03 15:08:07,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:08:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-12-03 15:08:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:08:07,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:07,472 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:07,472 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:07,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:07,472 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-12-03 15:08:07,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:07,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:07,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:07,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:07,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:07,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:07,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:07,578 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 15:08:07,578 INFO L205 CegarAbsIntRunner]: [0], [7], [44], [86], [93], [98], [102], [104], [106], [110], [114], [117] [2018-12-03 15:08:07,580 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:07,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:07,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:07,602 INFO L272 AbstractInterpreter]: Visited 12 different actions 20 times. Merged at 6 different actions 6 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:08:07,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:07,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:07,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:07,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:07,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:07,646 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:07,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:07,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:07,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:07,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2018-12-03 15:08:07,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:07,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:08:07,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:08:07,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:08:07,760 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-12-03 15:08:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:09,159 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-12-03 15:08:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:08:09,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-12-03 15:08:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:09,162 INFO L225 Difference]: With dead ends: 243 [2018-12-03 15:08:09,162 INFO L226 Difference]: Without dead ends: 239 [2018-12-03 15:08:09,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=1127, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:08:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-03 15:08:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-12-03 15:08:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:08:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-12-03 15:08:09,219 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-12-03 15:08:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:09,219 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-12-03 15:08:09,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:08:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-12-03 15:08:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:08:09,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:09,220 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:09,221 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:09,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-12-03 15:08:09,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:09,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:09,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:09,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:09,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:09,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:09,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:09,296 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 15:08:09,296 INFO L205 CegarAbsIntRunner]: [0], [36], [44], [46], [53], [76], [80], [86], [98], [102], [106], [120] [2018-12-03 15:08:09,298 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:09,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:09,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:09,318 INFO L272 AbstractInterpreter]: Visited 12 different actions 20 times. Merged at 6 different actions 6 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 15:08:09,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:09,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:09,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:09,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:09,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:09,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:09,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:09,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:09,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2018-12-03 15:08:09,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:09,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:09,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:09,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:08:09,449 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-12-03 15:08:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:10,683 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-12-03 15:08:10,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:10,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-12-03 15:08:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:10,686 INFO L225 Difference]: With dead ends: 202 [2018-12-03 15:08:10,686 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 15:08:10,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:08:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 15:08:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-12-03 15:08:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:08:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-12-03 15:08:10,747 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-12-03 15:08:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:10,747 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-12-03 15:08:10,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-12-03 15:08:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:08:10,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:10,749 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:10,749 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:10,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-12-03 15:08:10,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:10,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:10,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:10,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:10,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:10,865 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 15:08:10,865 INFO L205 CegarAbsIntRunner]: [0], [36], [44], [46], [53], [86], [98], [110], [114], [120] [2018-12-03 15:08:10,866 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:10,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:10,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:10,881 INFO L272 AbstractInterpreter]: Visited 10 different actions 14 times. Merged at 3 different actions 3 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:10,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:10,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:10,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:10,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:10,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:10,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:10,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:10,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:11,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:11,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2018-12-03 15:08:11,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:11,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:08:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:08:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:08:11,049 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 10 states. [2018-12-03 15:08:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:12,545 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2018-12-03 15:08:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:08:12,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-03 15:08:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:12,546 INFO L225 Difference]: With dead ends: 188 [2018-12-03 15:08:12,546 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:08:12,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:08:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:08:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:08:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:08:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:08:12,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-12-03 15:08:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:12,549 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:08:12,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:08:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:08:12,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:08:12,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:08:12,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:12,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:12,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:12,990 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 142 [2018-12-03 15:08:13,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:13,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:13,335 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 132 [2018-12-03 15:08:13,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:13,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:13,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:13,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,497 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2018-12-03 15:08:14,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,901 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 197 [2018-12-03 15:08:14,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:14,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:15,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:15,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:15,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:15,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:15,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:15,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:15,483 WARN L180 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 204 [2018-12-03 15:08:15,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,001 WARN L180 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 147 [2018-12-03 15:08:16,102 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 132 [2018-12-03 15:08:16,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,686 WARN L180 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 217 [2018-12-03 15:08:16,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:16,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,028 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 228 [2018-12-03 15:08:17,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,248 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 114 [2018-12-03 15:08:17,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,528 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 200 [2018-12-03 15:08:17,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,783 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 158 [2018-12-03 15:08:17,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:17,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,071 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 157 [2018-12-03 15:08:18,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,456 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 169 [2018-12-03 15:08:18,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:18,645 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 142 [2018-12-03 15:08:19,533 WARN L180 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 37 [2018-12-03 15:08:20,289 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 36 [2018-12-03 15:08:21,703 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 121 DAG size of output: 35 [2018-12-03 15:08:23,170 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 186 DAG size of output: 64 [2018-12-03 15:08:24,853 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 195 DAG size of output: 50 [2018-12-03 15:08:25,972 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 143 DAG size of output: 35 [2018-12-03 15:08:26,590 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 32 [2018-12-03 15:08:28,254 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 208 DAG size of output: 54 [2018-12-03 15:08:30,906 WARN L180 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 217 DAG size of output: 77 [2018-12-03 15:08:31,543 WARN L180 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37 [2018-12-03 15:08:33,453 WARN L180 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2018-12-03 15:08:35,226 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 150 DAG size of output: 51 [2018-12-03 15:08:36,703 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 145 DAG size of output: 48 [2018-12-03 15:08:37,962 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 169 DAG size of output: 36 [2018-12-03 15:08:38,774 WARN L180 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 37 [2018-12-03 15:08:38,779 INFO L444 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_i_1 1)) (.cse12 (+ product__local__threadpooling_working_1 1)) (.cse7 (+ product__local__threadpooling_working_0 2)) (.cse8 (+ product__local__threadpooling_i_0 1))) (let ((.cse1 (<= product__local__threadpooling_end_0 .cse8)) (.cse4 (<= .cse7 product__local__threadpooling_working_1)) (.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= .cse12 product__local__threadpooling_end_1)) (.cse0 (<= product__local__threadpooling_end_1 .cse9)) (.cse5 (= product__local__threadpooling_end_0 product__global_next)) (.cse6 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)))) (or (and (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (and (and (and (and .cse6 .cse1) .cse0 (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (<= .cse7 product__global_next) (<= .cse8 product__local__threadpooling_end_0)) (<= .cse9 product__local__threadpooling_i_0))) (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1) .cse1 (<= .cse9 product__local__threadpooling_end_1) .cse2 .cse3 .cse4) (let ((.cse11 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse6 (<= .cse9 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse10 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse10 product__global_next) (and .cse11 .cse2 .cse0 .cse3)) (and (and (<= .cse12 product__global_next) .cse0 .cse11) .cse5 (<= .cse10 product__local__threadpooling_end_0))))))) [2018-12-03 15:08:38,780 INFO L444 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_working_1 1)) (.cse3 (+ product__local__threadpooling_i_1 1))) (let ((.cse6 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse3 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_1 .cse3)) (.cse2 (<= .cse5 product__local__threadpooling_end_1)) (.cse4 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 .cse1 .cse2 (<= .cse3 product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)) (and (= product__local__threadpooling_end_0 product__global_next) (<= .cse4 product__local__threadpooling_end_0) (and (<= .cse5 product__global_next) .cse1 .cse6)) (and (and .cse6 .cse0 .cse1 .cse2) (<= .cse4 product__global_next))))) [2018-12-03 15:08:38,780 INFO L444 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_i_0 1)) (.cse15 (+ product__local__threadpooling_working_1 1)) (.cse7 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (let ((.cse4 (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse7 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse1 (+ product__local__threadpooling_working_0 1)) (.cse5 (<= .cse15 product__global_next)) (.cse6 (+ product__local__threadpooling_working_1 2)) (.cse8 (= product__local__threadpooling_end_0 product__global_next)) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse3 (<= .cse15 product__local__threadpooling_end_1)) (.cse12 (<= product__local__threadpooling_end_0 .cse9)) (.cse10 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse14 (+ product__local__threadpooling_working_0 2))) (or (and .cse0 (<= .cse1 product__global_next) .cse2 .cse3 .cse4) (and (or (and .cse5 .cse2 .cse4) (and (<= .cse6 product__local__threadpooling_working_0) .cse7)) .cse8 (<= .cse1 product__local__threadpooling_end_0)) (and (<= .cse9 product__local__threadpooling_end_0) (let ((.cse11 (<= .cse14 product__global_next)) (.cse13 (or .cse8 (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)))) (or (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse5 .cse10 .cse2 .cse11 .cse12 .cse13) (and (<= .cse6 product__local__threadpooling_i_0) .cse11 .cse12 .cse13)))) (and .cse0 .cse2 .cse3 (<= .cse9 product__global_next) .cse12 .cse10 (<= .cse14 product__local__threadpooling_working_1))))) [2018-12-03 15:08:38,781 INFO L448 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-12-03 15:08:38,781 INFO L448 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-12-03 15:08:38,781 INFO L444 ceAbstractionStarter]: At program point L119(lines 119 124) the Hoare annotation is: (let ((.cse3 (+ product__local__threadpooling_i_0 1))) (let ((.cse6 (+ product__local__threadpooling_working_0 2)) (.cse2 (+ product__local__threadpooling_working_1 1)) (.cse0 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse1 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse4 (<= product__local__threadpooling_end_0 .cse3)) (.cse5 (<= .cse3 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) .cse0 .cse1 (<= .cse2 product__local__threadpooling_end_1) (<= .cse3 product__global_next) .cse4 .cse5 (<= .cse6 product__local__threadpooling_working_1)) (and (= product__local__threadpooling_end_0 product__global_next) (<= .cse6 product__global_next) (or (and (<= .cse2 product__global_next) .cse0 .cse1 .cse4) (and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_0) .cse4)) .cse5)))) [2018-12-03 15:08:38,781 INFO L444 ceAbstractionStarter]: At program point L95(lines 95 190) the Hoare annotation is: (let ((.cse17 (+ product__local__threadpooling_i_1 1)) (.cse8 (+ product__local__threadpooling_i_0 1)) (.cse2 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse4 (+ product__local__threadpooling_working_0 2)) (.cse14 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= .cse14 product__local__threadpooling_i_0)) (.cse6 (let ((.cse18 (<= .cse4 product__local__threadpooling_i_1))) (or (and .cse2 .cse18) (and .cse18 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)))))) (.cse13 (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (.cse3 (<= product__local__threadpooling_end_0 .cse8)) (.cse11 (<= .cse17 product__local__threadpooling_end_1)) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse9 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_1 .cse17)) (.cse12 (<= .cse14 product__global_next)) (.cse5 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)))) (or (and (and (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 product__global_next) .cse5) (and (and (and .cse6 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse3) .cse0 .cse1)) .cse7 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (<= .cse8 product__global_next)) (and (let ((.cse10 (and (and (or (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) .cse6) .cse3))) (or (and .cse0 .cse9 .cse1 .cse10 (<= .cse8 product__local__threadpooling_end_0)) (and .cse2 .cse9 .cse1 .cse10 .cse11 .cse12))) .cse13) (and .cse1 .cse13 .cse3 .cse11 .cse9 (<= .cse4 product__local__threadpooling_working_1) .cse12) (let ((.cse15 (+ product__local__threadpooling_working_0 1)) (.cse16 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse2 (<= .cse17 product__global_next)) .cse5))) (or (and (<= .cse14 product__local__threadpooling_working_0) .cse1 .cse7 (<= .cse15 product__local__threadpooling_end_0) .cse16) (and (<= .cse15 product__global_next) (and .cse16 .cse9 .cse1 .cse12))))))) [2018-12-03 15:08:38,782 INFO L448 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-12-03 15:08:38,782 INFO L448 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-12-03 15:08:38,782 INFO L444 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1)) (.cse10 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse10 product__global_next)) (.cse8 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse6 (= product__local__threadpooling_end_0 product__global_next)) (.cse1 (<= product__local__threadpooling_end_0 .cse4)) (.cse7 (= product__local__threadpooling_i_0 product__local__threadpooling_working_0)) (.cse9 (<= .cse10 product__local__threadpooling_working_0)) (.cse3 (<= .cse4 product__local__threadpooling_end_0))) (or (let ((.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and (<= (+ product__local__threadpooling_working_0 1) product__global_next) (and .cse0 (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1) .cse2 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse3) (<= .cse4 product__global_next)) (and (and .cse2 .cse1 .cse5) .cse6 .cse7 .cse3))) (and (and (and .cse8 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse0) .cse1 .cse3 .cse5) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (and .cse8 .cse6 .cse1 .cse7 .cse9 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse3) (and .cse8 .cse6 .cse1 .cse7 .cse9 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse3)))) [2018-12-03 15:08:38,782 INFO L444 ceAbstractionStarter]: At program point L154(lines 154 159) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_i_0 1)) (.cse8 (+ product__local__threadpooling_i_1 1)) (.cse4 (+ product__local__threadpooling_working_1 2))) (let ((.cse6 (<= .cse4 product__local__threadpooling_i_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse8)) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse1 (<= product__local__threadpooling_end_0 .cse5)) (.cse2 (<= .cse5 product__local__threadpooling_end_0))) (or (let ((.cse3 (<= .cse8 product__local__threadpooling_end_1))) (or (and (and (= product__local__threadpooling_end_1 product__global_next) .cse0 .cse1 .cse2 .cse3 (<= .cse4 product__global_next)) (<= .cse5 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse3) .cse6 .cse0 .cse7 .cse1 .cse2))) (and (and .cse6 .cse0 .cse7 .cse1 (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse2) (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_i_0))))) [2018-12-03 15:08:38,782 INFO L444 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse2 (+ product__local__threadpooling_working_1 1))) (let ((.cse4 (+ product__local__threadpooling_working_1 2)) (.cse0 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse1 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse6 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (+ product__local__threadpooling_working_0 1)) (.cse3 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse7 (<= .cse2 product__local__threadpooling_end_1))) (or (and (or (and .cse0 .cse1 (<= .cse2 product__global_next) .cse3) (and (<= .cse4 product__local__threadpooling_working_0) .cse0)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse5 product__local__threadpooling_end_0)) (and (or (and .cse6 .cse3 .cse7) (<= .cse4 product__global_next)) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (and .cse0 .cse1 .cse6 (<= .cse5 product__global_next) .cse3 .cse7)))) [2018-12-03 15:08:38,782 INFO L448 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-12-03 15:08:38,783 INFO L448 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-12-03 15:08:38,783 INFO L444 ceAbstractionStarter]: At program point L196(lines 196 201) the Hoare annotation is: (let ((.cse0 (+ product__local__threadpooling_working_1 2)) (.cse18 (+ product__local__threadpooling_working_0 2)) (.cse19 (+ product__local__threadpooling_i_0 1))) (let ((.cse6 (+ product__local__threadpooling_i_1 2)) (.cse5 (<= .cse19 product__global_next)) (.cse4 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= .cse18 product__global_next)) (.cse9 (<= .cse18 product__local__threadpooling_i_1)) (.cse10 (<= .cse0 product__local__threadpooling_i_0)) (.cse7 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse2 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse12 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse1 (<= product__local__threadpooling_end_0 .cse19)) (.cse11 (= product__local__threadpooling_end_1 product__global_next)) (.cse14 (<= .cse19 product__local__threadpooling_end_0)) (.cse15 (<= .cse18 product__local__threadpooling_working_1)) (.cse16 (<= .cse0 product__global_next))) (or (and (and (and (<= .cse0 product__local__threadpooling_working_0) .cse1 .cse2) .cse3) .cse4 .cse5 (<= .cse6 product__local__threadpooling_i_0)) (and (let ((.cse8 (and .cse10 (and .cse1 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse2))) (or (and .cse7 .cse8 .cse3) (and .cse8 .cse9))) .cse4 (<= .cse6 product__local__threadpooling_end_0)) (let ((.cse13 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and .cse11 .cse12 .cse13 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse5 .cse1 .cse14 .cse15) (and (and .cse7 .cse13 .cse1 .cse16) .cse4 .cse3 .cse14))) (and (or (and .cse9 (let ((.cse17 (or (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)))) (or (and .cse10 .cse2 .cse14 (and (and .cse17 .cse11) .cse1)) (and .cse17 .cse7 .cse11 .cse2 .cse12 .cse1 .cse14 .cse16)))) (and .cse2 .cse12 .cse1 .cse11 .cse14 .cse15 .cse16)) (<= (+ product__local__threadpooling_i_0 2) product__global_next))))) [2018-12-03 15:08:38,783 INFO L448 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-12-03 15:08:38,783 INFO L448 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-12-03 15:08:38,783 INFO L444 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1))) (let ((.cse5 (<= product__local__threadpooling_end_0 .cse4))) (let ((.cse2 (+ product__local__threadpooling_working_1 1)) (.cse1 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse0 (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (not (= product__local__threadpooling_working_1 product__global_next))) .cse5)) (.cse3 (<= .cse4 product__local__threadpooling_end_0))) (or (and (<= (+ product__local__threadpooling_working_0 1) product__global_next) (and (= product__local__threadpooling_end_1 product__global_next) .cse0 .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3) (<= .cse4 product__global_next)) (and (= product__local__threadpooling_end_0 product__global_next) (or (and (<= .cse2 product__global_next) .cse1 .cse0) (and (<= (+ product__local__threadpooling_working_1 2) product__local__threadpooling_i_0) .cse5)) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse3))))) [2018-12-03 15:08:38,783 INFO L444 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse3 (+ product__local__threadpooling_i_0 1)) (.cse5 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (<= .cse5 product__global_next)) (.cse2 (<= product__local__threadpooling_end_1 .cse5)) (.cse1 (<= product__local__threadpooling_end_0 .cse3)) (.cse4 (<= .cse3 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (and .cse0 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse1) .cse2 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse3 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse4) (and (and .cse0 .cse2 .cse1 (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse4)))) [2018-12-03 15:08:38,784 INFO L444 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse14 (+ product__local__threadpooling_i_1 1)) (.cse10 (+ product__local__threadpooling_working_1 1)) (.cse15 (+ product__local__threadpooling_working_0 1)) (.cse13 (+ product__local__threadpooling_working_1 2))) (let ((.cse3 (<= .cse13 product__local__threadpooling_working_0)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= .cse15 product__local__threadpooling_end_0)) (.cse6 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse7 (<= .cse10 product__local__threadpooling_end_1)) (.cse8 (+ product__local__threadpooling_working_0 2)) (.cse11 (<= .cse15 product__global_next)) (.cse9 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (= product__local__threadpooling_end_1 product__global_next)) (.cse0 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse1 (<= product__local__threadpooling_end_1 .cse14))) (or (and .cse0 .cse1 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 (<= .cse8 product__local__threadpooling_working_1)) (and .cse0 .cse1 .cse2 .cse3 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse4) (and (and .cse0 .cse9 (<= .cse10 product__global_next) .cse6) .cse2 .cse4) (and .cse0 .cse9 .cse5 .cse11 .cse6 .cse7) (and (let ((.cse12 (<= .cse13 product__global_next))) (or (and .cse5 (<= .cse8 product__local__threadpooling_i_1) .cse1 .cse12) (and .cse11 (and (and .cse9 .cse5) .cse0 .cse1 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse12)))) (<= .cse14 product__global_next))))) [2018-12-03 15:08:38,784 INFO L444 ceAbstractionStarter]: At program point L207(lines 207 212) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_working_0 2)) (.cse8 (+ product__local__threadpooling_i_0 1)) (.cse4 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_1 .cse4)) (.cse2 (<= product__local__threadpooling_end_0 .cse8)) (.cse3 (<= .cse8 product__local__threadpooling_end_0)) (.cse5 (<= .cse7 product__local__threadpooling_working_1))) (or (and (and .cse0 .cse1 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse2 .cse3 (<= .cse4 product__local__threadpooling_end_1) .cse5) (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1)) (let ((.cse6 (<= .cse4 product__global_next))) (or (and (and .cse6 .cse1 .cse2 (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse7 product__global_next) .cse3) (and .cse0 .cse1 .cse2 (and (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse6) .cse3 .cse5)))))) [2018-12-03 15:08:38,784 INFO L448 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-12-03 15:08:38,784 INFO L444 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse25 (+ product__local__threadpooling_working_0 1)) (.cse22 (+ product__local__threadpooling_working_1 1)) (.cse17 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse13 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse9 (+ product__local__threadpooling_i_0 1)) (.cse26 (+ product__local__threadpooling_working_1 2)) (.cse27 (+ product__local__threadpooling_working_0 2)) (.cse16 (+ product__local__threadpooling_i_1 2))) (let ((.cse5 (<= .cse16 product__local__threadpooling_working_0)) (.cse11 (<= .cse27 product__local__threadpooling_working_1)) (.cse12 (<= .cse26 product__local__threadpooling_i_0)) (.cse15 (<= .cse27 product__local__threadpooling_i_1)) (.cse10 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse19 (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (.cse3 (<= product__local__threadpooling_end_0 .cse9)) (.cse23 (and .cse17 .cse13 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse7 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse8 (<= .cse22 product__local__threadpooling_end_1)) (.cse24 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse1 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= .cse26 product__local__threadpooling_working_0)) (.cse18 (<= .cse25 product__local__threadpooling_end_0)) (.cse2 (<= .cse27 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse6 (= product__local__threadpooling_end_1 product__global_next)) (.cse20 (<= .cse26 product__global_next))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= .cse9 product__global_next) .cse3 .cse10 .cse11) (and (let ((.cse14 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))) (or (and .cse12 .cse0 .cse3 .cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse13 .cse14) (and .cse15 (and .cse12 .cse0 .cse14 .cse3)))) .cse1 (<= .cse16 product__local__threadpooling_end_0)) (and .cse17 .cse0 .cse1 .cse4 .cse5 .cse18) (and .cse0 .cse19 .cse3 (and .cse6 .cse10) .cse11 .cse20) (and (and .cse13 .cse7 .cse3 .cse20) .cse1 .cse2) (and (let ((.cse21 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse21 .cse12 .cse6 .cse15 .cse0 .cse3) (and .cse15 (and .cse21 .cse13 .cse6 .cse0 .cse10 .cse3 .cse20)))) .cse19) (and (and (<= .cse22 product__global_next) .cse23 .cse7) .cse1 .cse18) (and .cse0 .cse24 .cse1 .cse3 (<= .cse16 product__local__threadpooling_i_0) .cse4 (<= .cse9 product__local__threadpooling_end_0)) (and .cse6 (<= .cse25 product__global_next) .cse23 .cse7 .cse8) (and .cse17 .cse0 .cse24 .cse1 .cse4 .cse18) (and .cse2 (and .cse0 (and .cse17 .cse13 .cse6) .cse20))))) [2018-12-03 15:08:38,784 INFO L444 ceAbstractionStarter]: At program point L43(lines 43 48) the Hoare annotation is: (let ((.cse8 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (+ product__local__threadpooling_working_1 2)) (.cse6 (<= .cse8 product__global_next))) (let ((.cse4 (+ product__local__threadpooling_working_0 1)) (.cse1 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse5 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= product__local__threadpooling_end_1 .cse8)) (.cse3 (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse6) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)))) (.cse7 (<= .cse0 product__global_next))) (or (and (<= .cse0 product__local__threadpooling_working_0) .cse1 .cse2 .cse3 (= product__local__threadpooling_end_0 product__global_next) (<= .cse4 product__local__threadpooling_end_0)) (and .cse5 .cse2 (and .cse6 (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1)) .cse7) (and (<= .cse4 product__global_next) (and .cse1 .cse5 .cse2 .cse3 .cse7)))))) [2018-12-03 15:08:38,816 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:08:38 BoogieIcfgContainer [2018-12-03 15:08:38,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:08:38,818 INFO L168 Benchmark]: Toolchain (without parser) took 55277.05 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.2 GB in the end (delta: -731.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 15:08:38,819 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-12-03 15:08:38,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.79 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-12-03 15:08:38,819 INFO L168 Benchmark]: Boogie Preprocessor took 36.00 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-12-03 15:08:38,820 INFO L168 Benchmark]: RCFGBuilder took 634.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:38,821 INFO L168 Benchmark]: TraceAbstraction took 54553.09 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.4 GB in the beginning and 2.2 GB in the end (delta: -753.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 15:08:38,824 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.19 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 48.79 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 36.00 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 634.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54553.09 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.4 GB in the beginning and 2.2 GB in the end (delta: -753.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 186]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 171]: 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: 181]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 176]: 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: 207]: Loop Invariant Derived loop invariant: (((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_i_0 + 2 <= _local__threadpooling_working_1) || ((((((_local__threadpooling_i_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _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_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (_local__threadpooling_end_0 == _local__threadpooling_i_1 && _local__threadpooling_end_0 == _local__threadpooling_working_1) && _local__threadpooling_i_1 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (((((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _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_i_0 + 1 <= _local__threadpooling_end_0)) || ((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _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_i_0 == _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) || (_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) || _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _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_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0) || (((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) || (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || (((((((_local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || ((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _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_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || (((_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && ((_local__threadpooling_end_0 == _local__threadpooling_i_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((((((((_local__threadpooling_end_0 == _local__threadpooling_i_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_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_end_1 <= _local__threadpooling_i_1 + 1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_i_0 + 2 <= _global_next) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) || (((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_1 + 1 <= _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next)) || (_local__threadpooling_working_0 + 1 <= _global_next && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_working_0 + 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_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_0 + 1 <= _global_next) || (((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _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 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 2 <= _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_i_0 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || ((((((_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_i_0 == _local__threadpooling_working_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && (_local__threadpooling_i_1 + 1 <= _global_next && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || ((((((_local__threadpooling_i_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((((((((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) || ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || (((((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _local__threadpooling_i_0) || (_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && ((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_working_1 + 2 <= _global_next)) || (((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _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_0 + 2 <= _global_next)) || (((((((_local__threadpooling_end_0 == _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_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && (((((_local__threadpooling_end_0 == _local__threadpooling_i_1 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_i_0 + 2 <= _global_next)) || ((((_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_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1)) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (_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 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((_local__threadpooling_end_0 == _local__threadpooling_i_1 && _local__threadpooling_end_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || (_local__threadpooling_end_0 == _global_next && (((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_i_0)) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || (_local__threadpooling_working_0 + 1 <= _global_next && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) || ((((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((_local__threadpooling_end_1 == _global_next && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || (((_local__threadpooling_end_0 == _global_next && _local__threadpooling_working_0 + 2 <= _global_next) && ((((_local__threadpooling_working_1 + 1 <= _global_next && (!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) || (_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0))) && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_i_0 + 1 <= _global_next) || ((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && ((_local__threadpooling_end_0 == _local__threadpooling_i_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0) && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) || (_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)))) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && ((_local__threadpooling_end_0 == _local__threadpooling_i_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0) && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) || (_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)))) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_i_0 + 2 <= _global_next)) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_working_1 + 2 <= _global_next)) || ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) || (_local__threadpooling_working_0 + 1 <= _global_next && ((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _global_next)) || (((((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_1 == _global_next)) || (_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (_local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0 && (((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_working_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (_local__threadpooling_end_0 == _global_next || _local__threadpooling_end_0 == _local__threadpooling_i_0)) || (((_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_end_0 == _local__threadpooling_i_0))))) || ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) || (((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (((((_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_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1)) || (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) || (_local__threadpooling_working_0 + 1 <= _global_next && ((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_i_1 + 1 <= _global_next) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || ((_local__threadpooling_end_0 == _global_next && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) && (_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next))) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 1 <= _global_next) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((_local__threadpooling_working_0 + 1 <= _global_next && (((_local__threadpooling_end_1 == _global_next && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_0 + 1 <= _global_next) || (((_local__threadpooling_end_0 == _global_next && (((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1))) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _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, 54.4s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 26.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 736 SDtfs, 2056 SDslu, 1070 SDs, 0 SdLazy, 7851 SolverSat, 1175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 134 SyntacticMatches, 8 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 1502 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 198 NumberOfFragments, 2512 HoareAnnotationTreeSize, 15 FomulaSimplifications, 98357491167 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 210347928 FormulaSimplificationTreeSizeReductionInter, 20.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 13994 SizeOfPredicates, 40 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 46/102 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...