java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:12:11,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:12:11,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:12:11,474 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:12:11,475 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:12:11,476 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:12:11,477 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:12:11,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:12:11,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:12:11,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:12:11,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:12:11,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:12:11,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:12:11,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:12:11,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:12:11,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:12:11,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:12:11,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:12:11,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:12:11,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:12:11,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:12:11,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:12:11,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:12:11,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:12:11,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:12:11,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:12:11,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:12:11,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:12:11,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:12:11,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:12:11,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:12:11,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:12:11,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:12:11,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:12:11,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:12:11,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:12:11,506 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:12:11,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:12:11,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:12:11,522 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:12:11,523 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:12:11,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:12:11,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:12:11,524 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:12:11,524 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:12:11,524 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:12:11,524 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:12:11,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:12:11,525 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:12:11,525 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:12:11,525 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:12:11,525 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:12:11,525 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:12:11,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:12:11,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:12:11,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:12:11,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:12:11,526 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:12:11,527 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:12:11,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:12:11,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:12:11,527 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:12:11,527 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:12:11,528 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:12:11,528 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:12:11,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:12:11,528 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:12:11,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:12:11,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:12:11,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:12:11,605 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:12:11,606 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:12:11,606 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-09-26 21:12:11,607 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-09-26 21:12:11,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:12:11,688 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:12:11,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:11,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:12:11,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:12:11,713 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 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,726 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 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,731 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:12:11,731 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:12:11,731 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:12:11,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:11,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:12:11,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:12:11,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:12:11,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (1/1) ... [2018-09-26 21:12:11,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:12:11,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:12:11,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:12:11,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:12:11,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (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-09-26 21:12:11,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:12:11,844 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:12:11,844 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:12:12,396 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:12:12,397 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:12 BoogieIcfgContainer [2018-09-26 21:12:12,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:12:12,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:12:12,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:12:12,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:12:12,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:11" (1/2) ... [2018-09-26 21:12:12,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30264bb0 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:12:12, skipping insertion in model container [2018-09-26 21:12:12,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:12" (2/2) ... [2018-09-26 21:12:12,406 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-09-26 21:12:12,417 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:12:12,427 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-09-26 21:12:12,481 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:12:12,482 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:12:12,482 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:12:12,482 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:12:12,482 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:12:12,482 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:12:12,483 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:12:12,483 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:12:12,483 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:12:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-26 21:12:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:12:12,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:12,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:12:12,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:12,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-09-26 21:12:12,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:12,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:12,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:12,799 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:12,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:12:12,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:12:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:12:12,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:12:12,820 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-09-26 21:12:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:13,514 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-09-26 21:12:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:12:13,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 21:12:13,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:13,532 INFO L225 Difference]: With dead ends: 46 [2018-09-26 21:12:13,532 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 21:12:13,537 INFO L605 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-09-26 21:12:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 21:12:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-09-26 21:12:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 21:12:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-09-26 21:12:13,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-09-26 21:12:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:13,583 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-09-26 21:12:13,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:12:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-09-26 21:12:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:12:13,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:13,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:12:13,585 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:13,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-09-26 21:12:13,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:13,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:13,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:13,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:13,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:13,748 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:13,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:12:13,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:12:13,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:12:13,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:12:13,751 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-09-26 21:12:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:14,585 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-09-26 21:12:14,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:12:14,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 21:12:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:14,588 INFO L225 Difference]: With dead ends: 75 [2018-09-26 21:12:14,588 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 21:12:14,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 21:12:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-09-26 21:12:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 21:12:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-09-26 21:12:14,609 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-09-26 21:12:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:14,609 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-09-26 21:12:14,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:12:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-09-26 21:12:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:14,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:14,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:14,611 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:14,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-09-26 21:12:14,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:14,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:14,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:14,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:14,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:14,764 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:14,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:12:14,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:14,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:14,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:14,765 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-09-26 21:12:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:15,988 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-09-26 21:12:15,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:12:15,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:15,992 INFO L225 Difference]: With dead ends: 198 [2018-09-26 21:12:15,992 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 21:12:15,993 INFO L605 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-09-26 21:12:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 21:12:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-09-26 21:12:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 21:12:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-09-26 21:12:16,020 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-09-26 21:12:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:16,020 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-09-26 21:12:16,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-09-26 21:12:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:16,022 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:16,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:16,022 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:16,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-09-26 21:12:16,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:16,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:16,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:16,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:16,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:16,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:12:16,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:16,140 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-09-26 21:12:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:17,119 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-09-26 21:12:17,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:12:17,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:17,126 INFO L225 Difference]: With dead ends: 227 [2018-09-26 21:12:17,126 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 21:12:17,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:12:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 21:12:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-09-26 21:12:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 21:12:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-09-26 21:12:17,166 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-09-26 21:12:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:17,166 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-09-26 21:12:17,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-09-26 21:12:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:17,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:17,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:17,168 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:17,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-09-26 21:12:17,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:17,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:17,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:17,288 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:17,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:12:17,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:17,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:17,289 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-09-26 21:12:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:18,858 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-09-26 21:12:18,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:12:18,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:18,860 INFO L225 Difference]: With dead ends: 286 [2018-09-26 21:12:18,861 INFO L226 Difference]: Without dead ends: 282 [2018-09-26 21:12:18,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:12:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-26 21:12:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-09-26 21:12:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 21:12:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-09-26 21:12:18,909 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-09-26 21:12:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:18,910 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-09-26 21:12:18,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-09-26 21:12:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:18,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:18,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:18,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:18,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-09-26 21:12:18,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:19,145 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-09-26 21:12:19,397 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-09-26 21:12:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:19,423 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:19,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:12:19,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:19,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:19,425 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-09-26 21:12:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:21,331 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-09-26 21:12:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:12:21,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:21,337 INFO L225 Difference]: With dead ends: 351 [2018-09-26 21:12:21,337 INFO L226 Difference]: Without dead ends: 347 [2018-09-26 21:12:21,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:12:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-26 21:12:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-09-26 21:12:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 21:12:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-09-26 21:12:21,411 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-09-26 21:12:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:21,411 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-09-26 21:12:21,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-09-26 21:12:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:21,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:21,416 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:21,420 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:21,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-09-26 21:12:21,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:21,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:21,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:21,566 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:21,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:12:21,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:21,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:21,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:21,567 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-09-26 21:12:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:22,858 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-09-26 21:12:22,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:12:22,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:22,864 INFO L225 Difference]: With dead ends: 353 [2018-09-26 21:12:22,864 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 21:12:22,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:12:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 21:12:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-09-26 21:12:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 21:12:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-09-26 21:12:22,927 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-09-26 21:12:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:22,928 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-09-26 21:12:22,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-09-26 21:12:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:22,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:22,929 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-26 21:12:22,930 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:22,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:22,930 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-09-26 21:12:22,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:22,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:22,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:22,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:22,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:23,055 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:23,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-26 21:12:23,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:23,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:23,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:12:23,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2018-09-26 21:12:23,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:23,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:23,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:23,200 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-09-26 21:12:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:24,378 INFO L93 Difference]: Finished difference Result 396 states and 923 transitions. [2018-09-26 21:12:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:12:24,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:12:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:24,381 INFO L225 Difference]: With dead ends: 396 [2018-09-26 21:12:24,381 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 21:12:24,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:12:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 21:12:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-09-26 21:12:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 21:12:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-09-26 21:12:24,432 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-09-26 21:12:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:24,432 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-09-26 21:12:24,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-09-26 21:12:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:12:24,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:24,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:24,434 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:24,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-09-26 21:12:24,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:24,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:24,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:24,642 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-09-26 21:12:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:25,053 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:25,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:12:25,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:25,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:25,056 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-09-26 21:12:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:26,627 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-09-26 21:12:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:12:26,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:12:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:26,630 INFO L225 Difference]: With dead ends: 383 [2018-09-26 21:12:26,630 INFO L226 Difference]: Without dead ends: 379 [2018-09-26 21:12:26,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:12:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-26 21:12:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-09-26 21:12:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-26 21:12:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-09-26 21:12:26,713 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-09-26 21:12:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:26,714 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-09-26 21:12:26,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-09-26 21:12:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:12:26,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:26,715 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:26,717 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:26,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-09-26 21:12:26,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:26,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:26,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:27,309 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:27,310 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-26 21:12:27,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:27,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:27,517 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:12:27,517 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-09-26 21:12:27,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:27,519 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 9 states. [2018-09-26 21:12:27,866 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-26 21:12:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:29,563 INFO L93 Difference]: Finished difference Result 648 states and 1427 transitions. [2018-09-26 21:12:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:12:29,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-09-26 21:12:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:29,571 INFO L225 Difference]: With dead ends: 648 [2018-09-26 21:12:29,572 INFO L226 Difference]: Without dead ends: 399 [2018-09-26 21:12:29,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-09-26 21:12:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-26 21:12:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 286. [2018-09-26 21:12:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-26 21:12:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 584 transitions. [2018-09-26 21:12:29,681 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 584 transitions. Word has length 10 [2018-09-26 21:12:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:29,682 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 584 transitions. [2018-09-26 21:12:29,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 584 transitions. [2018-09-26 21:12:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:29,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:29,683 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:29,684 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:29,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:29,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-09-26 21:12:29,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:29,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:29,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:29,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:29,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:29,840 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:29,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:12:29,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:12:29,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:12:29,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:12:29,841 INFO L87 Difference]: Start difference. First operand 286 states and 584 transitions. Second operand 4 states. [2018-09-26 21:12:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:30,067 INFO L93 Difference]: Finished difference Result 471 states and 962 transitions. [2018-09-26 21:12:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:12:30,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-09-26 21:12:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:30,068 INFO L225 Difference]: With dead ends: 471 [2018-09-26 21:12:30,068 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 21:12:30,069 INFO L605 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-09-26 21:12:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 21:12:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2018-09-26 21:12:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 21:12:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 321 transitions. [2018-09-26 21:12:30,115 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 321 transitions. Word has length 11 [2018-09-26 21:12:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:30,115 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 321 transitions. [2018-09-26 21:12:30,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:12:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 321 transitions. [2018-09-26 21:12:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:30,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:30,116 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:30,116 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:30,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:30,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-09-26 21:12:30,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:30,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:30,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:30,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:30,214 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:30,214 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-26 21:12:30,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:30,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:30,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:30,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-09-26 21:12:30,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:12:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:12:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:12:30,310 INFO L87 Difference]: Start difference. First operand 175 states and 321 transitions. Second operand 12 states. [2018-09-26 21:12:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:32,055 INFO L93 Difference]: Finished difference Result 253 states and 430 transitions. [2018-09-26 21:12:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:12:32,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-26 21:12:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:32,057 INFO L225 Difference]: With dead ends: 253 [2018-09-26 21:12:32,057 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 21:12:32,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 21:12:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 21:12:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 121. [2018-09-26 21:12:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 21:12:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-09-26 21:12:32,113 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 212 transitions. Word has length 11 [2018-09-26 21:12:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:32,113 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-09-26 21:12:32,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:12:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 212 transitions. [2018-09-26 21:12:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:12:32,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:32,114 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:32,115 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:32,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-09-26 21:12:32,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:32,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:32,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:32,600 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:32,600 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-26 21:12:32,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:32,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:32,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:32,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-09-26 21:12:32,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:12:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:12:32,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-09-26 21:12:32,807 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. Second operand 13 states. [2018-09-26 21:12:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:33,695 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2018-09-26 21:12:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:12:33,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-26 21:12:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:33,698 INFO L225 Difference]: With dead ends: 229 [2018-09-26 21:12:33,698 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 21:12:33,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=857, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 21:12:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 21:12:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-09-26 21:12:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 21:12:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-09-26 21:12:33,741 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 11 [2018-09-26 21:12:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:33,741 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-09-26 21:12:33,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:12:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-09-26 21:12:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:12:33,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:33,742 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:33,742 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:33,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-09-26 21:12:33,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:33,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:33,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:33,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:33,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:33,853 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:33,853 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2018-09-26 21:12:33,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:12:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:33,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:12:33,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:33,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-09-26 21:12:33,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:12:33,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:12:33,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:12:33,939 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-09-26 21:12:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:35,503 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-09-26 21:12:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:12:35,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-26 21:12:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:35,505 INFO L225 Difference]: With dead ends: 243 [2018-09-26 21:12:35,505 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 21:12:35,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:12:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 21:12:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-09-26 21:12:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 21:12:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-09-26 21:12:35,559 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-09-26 21:12:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:35,559 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-09-26 21:12:35,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:12:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-09-26 21:12:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:12:35,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:35,560 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:35,560 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:35,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-09-26 21:12:35,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:35,646 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:35,646 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-26 21:12:35,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:35,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:12:35,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:35,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-09-26 21:12:35,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:35,717 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-09-26 21:12:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:36,917 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-09-26 21:12:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:12:36,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-26 21:12:36,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:36,919 INFO L225 Difference]: With dead ends: 202 [2018-09-26 21:12:36,919 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 21:12:36,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:12:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 21:12:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-09-26 21:12:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 21:12:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-09-26 21:12:36,965 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-09-26 21:12:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:36,965 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-09-26 21:12:36,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-09-26 21:12:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:12:36,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:36,966 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:36,966 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:36,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-09-26 21:12:36,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:36,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:36,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:36,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:36,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:37,066 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:12:37,066 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-26 21:12:37,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:37,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:12:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:12:37,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:12:37,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-09-26 21:12:37,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:12:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:12:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:12:37,155 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 10 states. [2018-09-26 21:12:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:38,253 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2018-09-26 21:12:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:12:38,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-26 21:12:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:38,254 INFO L225 Difference]: With dead ends: 188 [2018-09-26 21:12:38,254 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:12:38,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2018-09-26 21:12:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:12:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:12:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:12:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:12:38,255 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-09-26 21:12:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:38,255 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:12:38,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:12:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:12:38,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:12:38,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:12:38,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:38,622 WARN L178 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 136 [2018-09-26 21:12:38,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:38,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:38,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:38,953 WARN L178 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 130 [2018-09-26 21:12:39,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,809 WARN L178 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 132 [2018-09-26 21:12:39,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:39,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,300 WARN L178 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 190 [2018-09-26 21:12:40,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:40,998 WARN L178 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 222 [2018-09-26 21:12:41,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:41,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:41,615 WARN L178 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 129 [2018-09-26 21:12:41,726 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 130 [2018-09-26 21:12:42,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,328 WARN L178 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 207 [2018-09-26 21:12:42,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,677 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 212 [2018-09-26 21:12:42,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,864 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 114 [2018-09-26 21:12:42,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:42,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,268 WARN L178 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 217 [2018-09-26 21:12:43,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,474 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 149 [2018-09-26 21:12:43,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:43,780 WARN L178 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 165 [2018-09-26 21:12:43,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:44,182 WARN L178 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 165 [2018-09-26 21:12:44,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:44,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:12:44,356 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 148 [2018-09-26 21:12:45,406 WARN L178 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-09-26 21:12:46,197 WARN L178 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 39 [2018-09-26 21:12:47,411 WARN L178 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 127 DAG size of output: 40 [2018-09-26 21:12:49,001 WARN L178 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 177 DAG size of output: 66 [2018-09-26 21:12:50,419 WARN L178 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 205 DAG size of output: 52 [2018-09-26 21:12:51,408 WARN L178 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 44 [2018-09-26 21:12:52,194 WARN L178 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 36 [2018-09-26 21:12:53,891 WARN L178 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 199 DAG size of output: 56 [2018-09-26 21:12:57,041 WARN L178 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 198 DAG size of output: 82 [2018-09-26 21:12:57,586 WARN L178 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 34 [2018-09-26 21:12:59,649 WARN L178 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 210 DAG size of output: 76 [2018-09-26 21:13:01,085 WARN L178 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 137 DAG size of output: 54 [2018-09-26 21:13:02,579 WARN L178 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 149 DAG size of output: 52 [2018-09-26 21:13:03,839 WARN L178 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 165 DAG size of output: 39 [2018-09-26 21:13:04,541 WARN L178 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 35 [2018-09-26 21:13:04,546 INFO L422 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse14 (+ product__local__threadpooling_i_1 1)) (.cse10 (+ product__local__threadpooling_working_1 1)) (.cse13 (+ product__local__threadpooling_working_0 2))) (let ((.cse4 (+ product__local__threadpooling_i_0 2)) (.cse3 (<= .cse13 product__local__threadpooling_working_1)) (.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse6 (<= .cse10 product__local__threadpooling_end_1)) (.cse5 (<= .cse14 product__global_next)) (.cse12 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse1 (<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1))) (.cse0 (<= product__local__threadpooling_end_1 .cse14)) (.cse9 (= product__local__threadpooling_end_0 product__global_next)) (.cse11 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0))) (or (and (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 product__global_next)) (and .cse0 (<= .cse4 product__local__threadpooling_working_1) .cse1 .cse5 .cse2 .cse6 .cse3) (let ((.cse8 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse12 .cse5 (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse7 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse7 product__global_next) (and .cse2 .cse8 .cse0 .cse6)) (and .cse9 (and (<= .cse10 product__global_next) .cse0 (and .cse8 .cse11)) (<= .cse7 product__local__threadpooling_end_0)))) (and (and (and (and (and .cse12 .cse1) .cse0) (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (<= .cse13 product__global_next)) .cse9 .cse11)))) [2018-09-26 21:13:04,546 INFO L422 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse3 (+ product__local__threadpooling_i_1 1)) (.cse6 (+ product__local__threadpooling_working_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= .cse6 product__local__threadpooling_end_1)) (.cse1 (<= product__local__threadpooling_end_1 .cse3)) (.cse5 (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))))) (.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 (<= .cse4 product__global_next) (and .cse5 .cse0 .cse1 .cse2)) (and (and (<= .cse6 product__global_next) .cse1 (and .cse5 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0))) (= product__local__threadpooling_end_0 product__global_next) (<= .cse4 product__local__threadpooling_end_0))))) [2018-09-26 21:13:04,547 INFO L422 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse15 (+ product__local__threadpooling_i_0 1)) (.cse13 (+ product__local__threadpooling_working_1 1)) (.cse10 (+ product__local__threadpooling_working_1 2)) (.cse14 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (let ((.cse4 (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse14 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse7 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse9 (<= .cse10 product__global_next)) (.cse5 (= product__local__threadpooling_end_0 product__global_next)) (.cse1 (+ product__local__threadpooling_working_0 1)) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse3 (<= .cse13 product__local__threadpooling_end_1)) (.cse12 (<= .cse15 product__global_next)) (.cse8 (<= product__local__threadpooling_end_0 .cse15)) (.cse11 (+ product__local__threadpooling_working_0 2))) (or (and .cse0 (<= .cse1 product__global_next) .cse2 .cse3 .cse4) (and (let ((.cse6 (<= .cse11 product__global_next))) (or (and .cse5 .cse6 (and .cse7 .cse2 .cse8 .cse9)) (and (<= .cse10 product__local__threadpooling_i_0) .cse5 .cse8 .cse6))) .cse12) (and (or (and (<= .cse13 product__global_next) (and (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse4) .cse2) (and (<= .cse10 product__local__threadpooling_working_0) .cse14) (and .cse14 .cse7 .cse2 .cse9)) .cse5 (<= .cse1 product__local__threadpooling_end_0)) (and .cse0 .cse2 .cse3 .cse12 .cse8 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= .cse11 product__local__threadpooling_working_1))))) [2018-09-26 21:13:04,547 INFO L426 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-09-26 21:13:04,547 INFO L426 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-09-26 21:13:04,547 INFO L426 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-09-26 21:13:04,548 INFO L422 ceAbstractionStarter]: At program point L119(lines 119 124) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_i_0 1))) (let ((.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse1 (<= product__local__threadpooling_end_0 .cse5)) (.cse4 (<= .cse5 product__local__threadpooling_end_0)) (.cse3 (+ product__local__threadpooling_working_0 2))) (or (and (let ((.cse0 (+ product__local__threadpooling_working_1 2))) (or (and (<= .cse0 product__local__threadpooling_i_0) .cse1) (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse2 .cse1 (<= .cse0 product__global_next)))) (= product__local__threadpooling_end_0 product__global_next) (<= .cse3 product__global_next) .cse4) (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse2 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse5 product__global_next) .cse1 .cse4 (<= .cse3 product__local__threadpooling_working_1))))) [2018-09-26 21:13:04,548 INFO L426 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-09-26 21:13:04,548 INFO L422 ceAbstractionStarter]: At program point L95(lines 95 190) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_working_0 2))) (let ((.cse21 (+ product__local__threadpooling_i_1 1)) (.cse16 (+ product__local__threadpooling_i_0 1)) (.cse18 (+ product__local__threadpooling_working_1 2)) (.cse13 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse10 (<= .cse5 product__local__threadpooling_i_1)) (.cse15 (<= .cse5 product__global_next))) (let ((.cse1 (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (.cse9 (or (and .cse13 .cse10 .cse15) (and .cse10 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse15))) (.cse7 (<= .cse18 product__local__threadpooling_i_0)) (.cse2 (<= product__local__threadpooling_end_0 .cse16)) (.cse12 (= product__local__threadpooling_end_0 product__global_next)) (.cse17 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse4 (= product__local__threadpooling_end_1 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 .cse21)) (.cse6 (<= .cse18 product__global_next)) (.cse14 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse3 (<= .cse21 product__local__threadpooling_end_1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 product__local__threadpooling_working_1) .cse6) (and (let ((.cse8 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse7 .cse4 .cse0 (and (and .cse8 .cse9) .cse2)) (and .cse10 (and .cse4 .cse0 (and (and .cse8 .cse11) .cse2) .cse6)))) .cse1) (and .cse12 (or (and (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse9) .cse2) .cse7 .cse0) (and (and .cse7 (and .cse13 .cse2) .cse0 .cse14) .cse15 (<= .cse16 product__local__threadpooling_end_0))) .cse17) (let ((.cse19 (let ((.cse20 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0))) (or (and .cse20 (and .cse13 (<= .cse21 product__global_next)) .cse14) (and .cse20 .cse11 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= .cse21 product__local__threadpooling_i_0) .cse3))))) (or (and (<= .cse18 product__local__threadpooling_working_0) .cse0 .cse12 (and .cse19 .cse17) (<= (+ product__local__threadpooling_working_0 1) product__local__threadpooling_end_0)) (and (and .cse4 .cse0 .cse19 .cse6) .cse15))))))) [2018-09-26 21:13:04,548 INFO L426 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-09-26 21:13:04,549 INFO L422 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 ((.cse6 (= product__local__threadpooling_end_0 product__global_next)) (.cse7 (= product__local__threadpooling_i_0 product__local__threadpooling_working_0)) (.cse9 (<= .cse10 product__local__threadpooling_working_0)) (.cse8 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= product__local__threadpooling_end_0 .cse4)) (.cse3 (<= .cse4 product__local__threadpooling_end_0)) (.cse5 (<= .cse10 product__global_next))) (or (let ((.cse1 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and (<= (+ product__local__threadpooling_working_0 1) product__global_next) (and .cse0 .cse1 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse2) .cse3)) (<= .cse4 product__global_next)) (and (and (and .cse1 .cse2 .cse3) .cse5) .cse6 .cse7))) (and .cse8 .cse6 .cse2 .cse7 .cse9 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse3) (and .cse8 .cse6 .cse2 .cse7 .cse9 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse3) (and (and (and .cse8 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse0) .cse2 .cse3 .cse5) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (<= (+ product__local__threadpooling_i_0 2) product__global_next))))) [2018-09-26 21:13:04,549 INFO L422 ceAbstractionStarter]: At program point L154(lines 154 159) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1))) (let ((.cse6 (<= product__local__threadpooling_end_0 .cse4)) (.cse5 (+ product__local__threadpooling_i_1 1))) (let ((.cse3 (+ product__local__threadpooling_working_1 2)) (.cse0 (<= product__local__threadpooling_end_1 .cse5)) (.cse1 (and (<= .cse5 product__global_next) .cse6)) (.cse2 (<= .cse4 product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_1 product__global_next) .cse0 (and .cse1 .cse2) (<= .cse3 product__global_next)) (<= .cse4 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (and (<= .cse3 product__local__threadpooling_i_0) (= product__local__threadpooling_end_0 product__global_next) (or (and (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) (<= .cse5 product__local__threadpooling_end_1)) .cse6) .cse0) (and .cse0 .cse1 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_i_0))) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse2))))) [2018-09-26 21:13:04,549 INFO L422 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_working_1 2)) (.cse8 (+ product__local__threadpooling_working_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= .cse8 product__local__threadpooling_end_1)) (.cse1 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse3 (<= .cse7 product__global_next))) (or (and (or (and .cse0 .cse1 .cse2) .cse3) (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (let ((.cse5 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse4 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse6 (+ product__local__threadpooling_working_0 1))) (or (and .cse4 .cse5 .cse0 (<= .cse6 product__global_next) .cse1 .cse2) (and (or (and (<= .cse7 product__local__threadpooling_working_0) .cse4) (and (<= .cse8 product__global_next) .cse1 (and .cse4 (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse5)) (and .cse4 .cse1 .cse3)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse6 product__local__threadpooling_end_0))))))) [2018-09-26 21:13:04,549 INFO L422 ceAbstractionStarter]: At program point L196(lines 196 201) the Hoare annotation is: (let ((.cse15 (+ product__local__threadpooling_i_0 1)) (.cse19 (+ product__local__threadpooling_i_1 1)) (.cse9 (+ product__local__threadpooling_working_1 2)) (.cse20 (+ product__local__threadpooling_working_0 2))) (let ((.cse8 (+ product__local__threadpooling_i_1 2)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= .cse20 product__global_next)) (.cse4 (<= .cse20 product__local__threadpooling_i_1)) (.cse5 (<= .cse9 product__local__threadpooling_i_0)) (.cse0 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse6 (<= product__local__threadpooling_end_1 .cse19)) (.cse14 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse7 (<= product__local__threadpooling_end_0 .cse15)) (.cse13 (= product__local__threadpooling_end_1 product__global_next)) (.cse10 (<= .cse15 product__local__threadpooling_end_0)) (.cse16 (<= .cse20 product__local__threadpooling_working_1)) (.cse12 (<= .cse9 product__global_next))) (or (and (let ((.cse1 (and .cse5 .cse6 (and .cse7 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2))) (<= .cse8 product__local__threadpooling_end_0)) (and (and (<= .cse9 product__local__threadpooling_working_0) (and .cse2 .cse7) .cse6) .cse3 .cse10 (<= .cse8 product__local__threadpooling_i_0)) (let ((.cse11 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and .cse2 (and .cse0 .cse11 .cse7 .cse12) .cse3 .cse10) (and .cse13 .cse14 .cse11 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse15 product__global_next) .cse7 .cse10 .cse16))) (let ((.cse18 (<= .cse19 product__local__threadpooling_end_1))) (or (and (and .cse4 (let ((.cse17 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse5 .cse13 .cse6 (and .cse17 .cse7) .cse18) (and .cse17 .cse0 .cse13 .cse6 .cse14 .cse7 .cse18 .cse12)))) (<= (+ product__local__threadpooling_end_1 product__local__threadpooling_i_0 1) (+ product__global_next product__local__threadpooling_i_1))) (and (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_i_1) .cse6 (and .cse14 .cse18) .cse7 .cse13 .cse10 .cse16 .cse12)))))) [2018-09-26 21:13:04,549 INFO L426 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-09-26 21:13:04,550 INFO L426 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-09-26 21:13:04,550 INFO L422 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse3 (+ product__local__threadpooling_i_0 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse1 (<= product__local__threadpooling_end_0 .cse3)) (.cse2 (<= .cse3 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 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1) .cse2)) (<= .cse3 product__global_next)) (and (let ((.cse4 (+ product__local__threadpooling_working_1 2))) (or (and .cse1 .cse0 (<= .cse4 product__global_next)) (and (<= .cse4 product__local__threadpooling_i_0) .cse1))) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse2)))) [2018-09-26 21:13:04,550 INFO L422 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1)) (.cse0 (+ product__local__threadpooling_i_1 1))) (let ((.cse3 (+ product__local__threadpooling_working_1 1)) (.cse2 (<= product__local__threadpooling_end_1 .cse0)) (.cse1 (<= product__local__threadpooling_end_0 .cse4)) (.cse5 (<= .cse4 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (and (<= .cse0 product__global_next) (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse1) .cse2 (<= .cse3 product__local__threadpooling_end_1) (<= .cse4 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse5) (and (= product__local__threadpooling_end_0 product__global_next) (and (<= .cse3 product__global_next) (and .cse2 .cse1 (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) (<= .cse0 product__local__threadpooling_i_0)))) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse5)))) [2018-09-26 21:13:04,550 INFO L426 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-09-26 21:13:04,550 INFO L422 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse14 (+ product__local__threadpooling_working_0 1)) (.cse7 (+ product__local__threadpooling_i_1 1)) (.cse15 (+ product__local__threadpooling_working_1 2))) (let ((.cse3 (<= .cse15 product__local__threadpooling_working_0)) (.cse1 (<= product__local__threadpooling_end_1 .cse7)) (.cse6 (+ product__local__threadpooling_working_0 2)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (<= .cse15 product__global_next)) (.cse4 (<= .cse14 product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse9 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (= product__local__threadpooling_end_1 product__global_next)) (.cse10 (<= .cse14 product__global_next))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse4) (and .cse5 (<= .cse6 product__local__threadpooling_i_1) .cse1 (<= .cse7 product__local__threadpooling_end_1) .cse8) (and .cse3 (and .cse0 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse1 .cse2 .cse4) (and (and (and .cse9 .cse5) .cse0 .cse1 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse8) .cse10) (let ((.cse13 (+ product__local__threadpooling_working_1 1))) (let ((.cse11 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse12 (<= .cse13 product__local__threadpooling_end_1))) (or (and .cse5 .cse11 .cse12 (<= .cse6 product__local__threadpooling_working_1)) (and .cse2 (or (and (and .cse0 (<= .cse7 product__global_next) .cse9 .cse11) (<= .cse13 product__global_next)) (and .cse0 .cse9 .cse11 .cse8)) .cse4) (and .cse0 .cse9 .cse5 .cse10 .cse11 .cse12))))))) [2018-09-26 21:13:04,550 INFO L422 ceAbstractionStarter]: At program point L207(lines 207 212) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_i_0 1)) (.cse4 (+ product__local__threadpooling_i_1 1)) (.cse6 (+ product__local__threadpooling_working_0 2))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse6 product__local__threadpooling_working_1)) (.cse1 (<= product__local__threadpooling_end_1 .cse4)) (.cse2 (<= product__local__threadpooling_end_0 .cse7)) (.cse3 (<= .cse7 product__local__threadpooling_end_0))) (or (and (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1) (and .cse0 .cse1 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse2 .cse3 (<= .cse4 product__local__threadpooling_end_1) .cse5)) (or (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) (<= .cse4 product__global_next)) .cse3 .cse5) (and (and (and .cse1 .cse2 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse6 product__global_next) .cse3))))) [2018-09-26 21:13:04,551 INFO L426 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-09-26 21:13:04,551 INFO L422 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse11 (+ product__local__threadpooling_working_1 1)) (.cse14 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse7 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse3 (+ product__local__threadpooling_i_0 1)) (.cse12 (+ product__local__threadpooling_i_1 1)) (.cse28 (+ product__local__threadpooling_working_0 1)) (.cse27 (+ product__local__threadpooling_i_1 2)) (.cse29 (+ product__local__threadpooling_working_1 2)) (.cse30 (+ product__local__threadpooling_working_0 2))) (let ((.cse20 (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (.cse5 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse6 (<= .cse30 product__local__threadpooling_working_1)) (.cse8 (<= .cse29 product__global_next)) (.cse10 (<= .cse30 product__global_next)) (.cse24 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (.cse19 (<= .cse29 product__local__threadpooling_i_0)) (.cse16 (<= .cse30 product__local__threadpooling_i_1)) (.cse22 (<= .cse27 product__local__threadpooling_working_0)) (.cse15 (<= .cse28 product__local__threadpooling_end_0)) (.cse18 (<= product__local__threadpooling_end_1 .cse12)) (.cse23 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse9 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= product__local__threadpooling_end_0 .cse3)) (.cse21 (<= .cse29 product__local__threadpooling_working_0)) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse25 (<= .cse28 product__global_next)) (.cse13 (and .cse14 .cse7 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse1 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse2 (<= .cse11 product__local__threadpooling_end_1))) (or (and .cse0 .cse1 .cse2 (<= .cse3 product__global_next) .cse4 .cse5 .cse6) (and (and .cse7 .cse1 .cse4 .cse8) .cse9 .cse10) (and (or (and (<= .cse11 product__global_next) (and (<= .cse12 product__global_next) .cse13 .cse1)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse14 .cse1 .cse8)) .cse9 .cse15) (and (and .cse16 (let ((.cse17 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse17 .cse7 .cse0 .cse18 .cse5 .cse4 .cse8) (and .cse17 .cse19 .cse0 .cse18 .cse4)))) .cse20) (and .cse18 .cse20 .cse4 (and .cse0 .cse5) .cse6 .cse8) (and .cse18 .cse9 .cse4 .cse10 .cse21 .cse22) (and .cse14 .cse18 .cse23 .cse9 .cse21 .cse15) (and (and .cse18 (and .cse14 .cse7 .cse0) .cse24 .cse8) .cse25) (and (let ((.cse26 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))) (or (and .cse19 .cse18 .cse9 .cse10 .cse4 .cse24 .cse7 .cse26) (and .cse19 .cse18 .cse9 .cse4 .cse16 .cse26))) (<= .cse27 product__local__threadpooling_end_0)) (and .cse14 .cse18 .cse9 .cse21 .cse22 .cse15) (and .cse18 .cse23 .cse9 .cse4 (<= .cse27 product__local__threadpooling_i_0) .cse21 (<= .cse3 product__local__threadpooling_end_0)) (and .cse0 .cse25 .cse13 .cse1 .cse2)))) [2018-09-26 21:13:04,551 INFO L422 ceAbstractionStarter]: At program point L43(lines 43 48) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_i_1 1))) (let ((.cse4 (+ product__local__threadpooling_working_1 2)) (.cse2 (<= .cse7 product__local__threadpooling_end_1))) (let ((.cse6 (+ product__local__threadpooling_working_0 1)) (.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_1 .cse7)) (.cse5 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (or (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse7 product__global_next)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (= product__local__threadpooling_end_1 product__local__threadpooling_working_0) .cse2)))) (.cse3 (<= .cse4 product__global_next))) (or (and .cse0 (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) .cse1 .cse2 .cse3) (and (<= .cse4 product__local__threadpooling_working_0) .cse1 (and (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0) .cse5) (= product__local__threadpooling_end_0 product__global_next) (<= .cse6 product__local__threadpooling_end_0)) (and (<= .cse6 product__global_next) (and .cse0 .cse1 .cse5 .cse3)))))) [2018-09-26 21:13:04,586 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:13:04 BoogieIcfgContainer [2018-09-26 21:13:04,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:13:04,587 INFO L168 Benchmark]: Toolchain (without parser) took 52901.44 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 493.4 MB). Free memory was 1.5 GB in the beginning and 947.8 MB in the end (delta: 519.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-26 21:13:04,588 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-09-26 21:13:04,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.88 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-09-26 21:13:04,589 INFO L168 Benchmark]: Boogie Preprocessor took 28.94 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-09-26 21:13:04,589 INFO L168 Benchmark]: RCFGBuilder took 633.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:13:04,590 INFO L168 Benchmark]: TraceAbstraction took 52187.84 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 493.4 MB). Free memory was 1.4 GB in the beginning and 947.8 MB in the end (delta: 498.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-26 21:13:04,593 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.22 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 44.88 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 28.94 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 633.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52187.84 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 493.4 MB). Free memory was 1.4 GB in the beginning and 947.8 MB in the end (delta: 498.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 176]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 186]: assertion always holds For all program executions holds that assertion always holds at this location - 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: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 181]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (_local__threadpooling_i_0 + 2 <= _local__threadpooling_working_1 && (((((_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_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) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _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) - 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_i_1 + 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_i_0 + 1 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 == _global_next) && ((((_local__threadpooling_end_1 == _local__threadpooling_working_0 && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_1 + 1 <= _global_next && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0))) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_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) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0) || ((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1))) || ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((!(_local__threadpooling_working_0 == _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_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || ((_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_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 == _global_next && _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_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0)) || (((_local__threadpooling_end_0 == _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_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _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 + 2 <= _local__threadpooling_i_1 && (((((_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 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_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_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_1 + 2 <= _global_next))) && _local__threadpooling_end_1 + _local__threadpooling_i_0 + 1 <= _global_next + _local__threadpooling_i_1) || (((((((_local__threadpooling_i_0 + 2 <= _local__threadpooling_i_1 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _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) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((_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_i_1 + 1 <= _local__threadpooling_end_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_i_1 + 2 <= _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 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1))) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (_local__threadpooling_working_0 + 1 <= _global_next && ((_local__threadpooling_end_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_0 == _local__threadpooling_i_1)) || ((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_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_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 + 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_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_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)) || ((((((_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_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) - 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_end_0 == _global_next && _local__threadpooling_working_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 == _local__threadpooling_i_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_i_0) && _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 == _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_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_working_1 + 1 <= _global_next && (_local__threadpooling_i_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_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((_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_end_0 == _local__threadpooling_i_1 && _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_0 + 1))) && _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_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_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_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_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 <= _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_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next)) || (((((((((_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_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_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_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_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 == _local__threadpooling_i_0)) && _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_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) - 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_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_i_0 + 2 <= _global_next) || ((((((_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 <= _global_next) && _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_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 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) || ((_local__threadpooling_end_0 == _global_next && (_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_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || ((((((!(_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_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _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_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) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((_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_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_working_1 == _local__threadpooling_working_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _global_next))) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || (_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && ((_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_working_0 == _local__threadpooling_working_1)) && _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_end_0 == _global_next && (((((_local__threadpooling_end_1 == _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 <= _global_next) || ((_local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _global_next))) && _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_working_1 + 2 <= _local__threadpooling_i_0 && !(_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_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0))) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || ((((_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_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_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _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_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_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_i_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1))) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 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_end_0 == _global_next && _local__threadpooling_working_0 + 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_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next)) && _local__threadpooling_i_0 + 1 <= _global_next)) || ((((((_local__threadpooling_working_1 + 1 <= _global_next && _local__threadpooling_i_1 + 1 <= _global_next && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && !(_local__threadpooling_working_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 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _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_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_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 == _global_next && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_1 + 2 <= _global_next)) || ((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _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_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_working_0 + 1 <= _global_next)) || ((((_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 == _global_next && (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _global_next) || (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _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) - 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_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_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((_local__threadpooling_working_0 + 1 <= _global_next && ((_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 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_0 + 1 <= _global_next) || ((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 2 <= _global_next) || (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1)) && _local__threadpooling_end_0 == _global_next) && _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, 52.0s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 20.1s AutomataDifference, 0.0s DeadEndRemovalTime, 26.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 2102 SDslu, 1085 SDs, 0 SdLazy, 7962 SolverSat, 1217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1514 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 198 NumberOfFragments, 2648 HoareAnnotationTreeSize, 15 FomulaSimplifications, 96326893123 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 63859721 FormulaSimplificationTreeSizeReductionInter, 20.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 9198 SizeOfPredicates, 28 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 26/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-13-04-613.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-13-04-613.csv Received shutdown request...