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_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:24:42,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:24:42,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:24:42,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:24:42,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:24:42,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:24:42,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:24:42,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:24:42,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:24:42,598 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:24:42,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:24:42,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:24:42,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:24:42,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:24:42,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:24:42,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:24:42,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:24:42,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:24:42,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:24:42,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:24:42,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:24:42,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:24:42,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:24:42,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:24:42,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:24:42,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:24:42,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:24:42,619 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:24:42,620 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:24:42,621 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:24:42,621 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:24:42,622 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:24:42,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:24:42,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:24:42,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:24:42,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:24:42,625 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:24:42,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:24:42,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:24:42,644 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:24:42,645 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:24:42,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:24:42,646 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:24:42,646 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:24:42,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:24:42,646 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:24:42,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:24:42,647 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:24:42,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:24:42,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:24:42,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:24:42,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:24:42,648 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:24:42,648 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:24:42,648 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:24:42,648 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:24:42,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:24:42,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:24:42,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:24:42,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:42,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:24:42,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:24:42,651 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:24:42,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:24:42,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:24:42,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:24:42,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:24:42,652 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:24:42,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:24:42,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:24:42,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:24:42,734 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:24:42,734 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:24:42,735 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-10-01 00:24:42,736 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-10-01 00:24:42,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:24:42,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:24:42,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:42,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:24:42,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:24:42,847 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 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,860 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 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,866 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:24:42,866 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:24:42,866 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:24:42,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:42,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:24:42,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:24:42,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:24:42,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/1) ... [2018-10-01 00:24:42,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:24:42,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:24:42,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:24:42,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:24:42,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (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-10-01 00:24:42,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-01 00:24:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-01 00:24:42,987 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-01 00:24:43,473 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:24:43,473 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:43 BoogieIcfgContainer [2018-10-01 00:24:43,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:24:43,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:24:43,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:24:43,478 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:24:43,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:42" (1/2) ... [2018-10-01 00:24:43,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ad74b and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:24:43, skipping insertion in model container [2018-10-01 00:24:43,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:43" (2/2) ... [2018-10-01 00:24:43,482 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-10-01 00:24:43,492 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:24:43,500 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-01 00:24:43,551 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:24:43,551 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:24:43,552 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:24:43,552 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:24:43,552 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:24:43,552 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:24:43,552 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:24:43,552 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:24:43,553 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:24:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-01 00:24:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:24:43,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:43,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:24:43,579 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:43,586 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-10-01 00:24:43,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:43,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:43,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:43,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:43,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:43,831 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:43,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:43,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:24:43,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:24:43,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:43,851 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-10-01 00:24:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:45,725 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-10-01 00:24:45,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:24:45,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:24:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:45,743 INFO L225 Difference]: With dead ends: 46 [2018-10-01 00:24:45,743 INFO L226 Difference]: Without dead ends: 44 [2018-10-01 00:24:45,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-01 00:24:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-10-01 00:24:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-01 00:24:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-10-01 00:24:45,787 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-10-01 00:24:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:45,788 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-10-01 00:24:45,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:24:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-10-01 00:24:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:24:45,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:45,789 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:24:45,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:45,790 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:45,790 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-10-01 00:24:45,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:45,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:45,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:45,870 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:45,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:45,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:24:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:24:45,872 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:45,873 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-10-01 00:24:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:46,919 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-10-01 00:24:46,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:24:46,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:24:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:46,923 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:24:46,924 INFO L226 Difference]: Without dead ends: 71 [2018-10-01 00:24:46,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-01 00:24:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-10-01 00:24:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-01 00:24:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-10-01 00:24:46,944 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-10-01 00:24:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:46,944 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-10-01 00:24:46,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:24:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-10-01 00:24:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:24:46,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:46,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:46,946 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:46,946 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-10-01 00:24:46,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:47,426 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:47,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:24:47,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:47,429 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:47,429 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-10-01 00:24:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:49,957 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-10-01 00:24:49,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:24:49,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:24:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:49,961 INFO L225 Difference]: With dead ends: 198 [2018-10-01 00:24:49,961 INFO L226 Difference]: Without dead ends: 147 [2018-10-01 00:24:49,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:24:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-01 00:24:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-10-01 00:24:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:24:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-10-01 00:24:49,991 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-10-01 00:24:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:49,991 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-10-01 00:24:49,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:24:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-10-01 00:24:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:24:49,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:49,993 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:49,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:49,994 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-10-01 00:24:49,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:49,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:49,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:49,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:50,094 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:50,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:24:50,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:50,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:50,095 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-10-01 00:24:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:54,077 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-10-01 00:24:54,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:24:54,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:24:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:54,083 INFO L225 Difference]: With dead ends: 227 [2018-10-01 00:24:54,083 INFO L226 Difference]: Without dead ends: 223 [2018-10-01 00:24:54,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-01 00:24:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-10-01 00:24:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-01 00:24:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-10-01 00:24:54,114 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-10-01 00:24:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:54,115 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-10-01 00:24:54,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:24:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-10-01 00:24:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:24:54,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:54,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:54,117 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:54,117 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:54,117 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-10-01 00:24:54,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:54,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:54,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:54,194 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:54,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:24:54,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:54,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:54,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:54,195 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-10-01 00:24:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:57,079 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-10-01 00:24:57,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:24:57,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:24:57,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:57,081 INFO L225 Difference]: With dead ends: 286 [2018-10-01 00:24:57,082 INFO L226 Difference]: Without dead ends: 282 [2018-10-01 00:24:57,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:24:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-01 00:24:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-10-01 00:24:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-01 00:24:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-10-01 00:24:57,124 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-10-01 00:24:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:57,125 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-10-01 00:24:57,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:24:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-10-01 00:24:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:24:57,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:57,126 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:57,127 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:57,127 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:57,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-10-01 00:24:57,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:57,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:57,565 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:57,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:24:57,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:57,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:57,566 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:57,566 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-10-01 00:25:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:00,663 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-10-01 00:25:00,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:25:00,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:25:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:00,668 INFO L225 Difference]: With dead ends: 351 [2018-10-01 00:25:00,668 INFO L226 Difference]: Without dead ends: 347 [2018-10-01 00:25:00,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-01 00:25:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-10-01 00:25:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-01 00:25:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-10-01 00:25:00,719 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-10-01 00:25:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:00,720 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-10-01 00:25:00,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:25:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-10-01 00:25:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:00,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:00,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:00,722 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:00,722 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-10-01 00:25:00,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:00,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:00,900 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:00,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:25:00,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:25:00,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:25:00,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:00,902 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-10-01 00:25:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:03,306 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-10-01 00:25:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:25:03,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:25:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:03,310 INFO L225 Difference]: With dead ends: 353 [2018-10-01 00:25:03,311 INFO L226 Difference]: Without dead ends: 349 [2018-10-01 00:25:03,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-01 00:25:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-10-01 00:25:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-01 00:25:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-10-01 00:25:03,361 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-10-01 00:25:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:03,362 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-10-01 00:25:03,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:25:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-10-01 00:25:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:03,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:03,364 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-01 00:25:03,364 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:03,364 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-10-01 00:25:03,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:03,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:03,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:03,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:03,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:03,433 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:03,433 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-10-01 00:25:03,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:03,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:03,870 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:25:03,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2018-10-01 00:25:03,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:25:03,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:25:03,871 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:03,871 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-10-01 00:25:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:06,611 INFO L93 Difference]: Finished difference Result 396 states and 923 transitions. [2018-10-01 00:25:06,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:25:06,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:25:06,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:06,615 INFO L225 Difference]: With dead ends: 396 [2018-10-01 00:25:06,615 INFO L226 Difference]: Without dead ends: 242 [2018-10-01 00:25:06,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-01 00:25:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-10-01 00:25:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-01 00:25:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-10-01 00:25:06,682 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-10-01 00:25:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:06,682 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-10-01 00:25:06,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:25:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-10-01 00:25:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:06,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:06,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:06,684 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:06,684 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:06,684 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-10-01 00:25:06,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:06,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:06,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:06,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:07,005 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:07,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-01 00:25:07,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:25:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:25:07,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:07,006 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-10-01 00:25:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:08,931 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-10-01 00:25:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:25:08,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-01 00:25:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:08,935 INFO L225 Difference]: With dead ends: 383 [2018-10-01 00:25:08,935 INFO L226 Difference]: Without dead ends: 379 [2018-10-01 00:25:08,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-01 00:25:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-10-01 00:25:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-01 00:25:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-10-01 00:25:09,003 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-10-01 00:25:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:09,003 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-10-01 00:25:09,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:25:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-10-01 00:25:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:09,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:09,005 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:09,005 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:09,005 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-10-01 00:25:09,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:09,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:09,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:09,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:09,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:09,091 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:09,091 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-10-01 00:25:09,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:09,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:09,158 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:25:09,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-10-01 00:25:09,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:09,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:09,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:09,159 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 9 states. [2018-10-01 00:25:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:14,667 INFO L93 Difference]: Finished difference Result 648 states and 1427 transitions. [2018-10-01 00:25:14,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:25:14,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-01 00:25:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:14,671 INFO L225 Difference]: With dead ends: 648 [2018-10-01 00:25:14,671 INFO L226 Difference]: Without dead ends: 399 [2018-10-01 00:25:14,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-01 00:25:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 286. [2018-10-01 00:25:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-01 00:25:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 584 transitions. [2018-10-01 00:25:14,760 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 584 transitions. Word has length 10 [2018-10-01 00:25:14,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:14,760 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 584 transitions. [2018-10-01 00:25:14,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 584 transitions. [2018-10-01 00:25:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:25:14,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:14,761 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:14,762 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:14,762 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-10-01 00:25:14,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:14,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:14,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:14,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:14,930 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:14,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:25:14,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:25:14,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:25:14,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:14,933 INFO L87 Difference]: Start difference. First operand 286 states and 584 transitions. Second operand 4 states. [2018-10-01 00:25:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:15,291 INFO L93 Difference]: Finished difference Result 471 states and 962 transitions. [2018-10-01 00:25:15,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:25:15,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-10-01 00:25:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:15,295 INFO L225 Difference]: With dead ends: 471 [2018-10-01 00:25:15,296 INFO L226 Difference]: Without dead ends: 212 [2018-10-01 00:25:15,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:25:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-01 00:25:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2018-10-01 00:25:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-01 00:25:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 321 transitions. [2018-10-01 00:25:15,344 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 321 transitions. Word has length 11 [2018-10-01 00:25:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:15,344 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 321 transitions. [2018-10-01 00:25:15,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:25:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 321 transitions. [2018-10-01 00:25:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:25:15,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:15,345 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:15,346 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:15,346 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-10-01 00:25:15,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:15,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:15,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:15,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:15,478 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:15,478 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-10-01 00:25:15,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:15,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:15,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:15,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-01 00:25:15,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:25:15,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:25:15,583 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:15,583 INFO L87 Difference]: Start difference. First operand 175 states and 321 transitions. Second operand 12 states. [2018-10-01 00:25:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:19,072 INFO L93 Difference]: Finished difference Result 253 states and 430 transitions. [2018-10-01 00:25:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:25:19,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-01 00:25:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:19,073 INFO L225 Difference]: With dead ends: 253 [2018-10-01 00:25:19,073 INFO L226 Difference]: Without dead ends: 249 [2018-10-01 00:25:19,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-01 00:25:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 121. [2018-10-01 00:25:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-01 00:25:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-10-01 00:25:19,126 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 212 transitions. Word has length 11 [2018-10-01 00:25:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:19,127 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-10-01 00:25:19,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:25:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 212 transitions. [2018-10-01 00:25:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:25:19,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:19,128 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:19,128 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:19,128 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:19,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-10-01 00:25:19,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:19,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:19,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:19,444 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:19,444 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-10-01 00:25:19,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:19,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:19,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:19,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-10-01 00:25:19,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:19,571 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:19,571 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. Second operand 13 states. [2018-10-01 00:25:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:22,207 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2018-10-01 00:25:22,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:25:22,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-01 00:25:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:22,209 INFO L225 Difference]: With dead ends: 229 [2018-10-01 00:25:22,209 INFO L226 Difference]: Without dead ends: 225 [2018-10-01 00:25:22,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:25:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-01 00:25:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-10-01 00:25:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-01 00:25:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-10-01 00:25:22,261 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 11 [2018-10-01 00:25:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:22,262 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-10-01 00:25:22,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:25:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-10-01 00:25:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:22,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:22,263 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:22,263 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:22,263 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-10-01 00:25:22,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:22,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:22,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:22,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:22,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:22,365 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:22,365 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:22,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:22,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:25:22,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:22,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-10-01 00:25:22,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:25:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:25:22,475 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:22,475 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-10-01 00:25:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:27,286 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-10-01 00:25:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:25:27,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-01 00:25:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:27,288 INFO L225 Difference]: With dead ends: 243 [2018-10-01 00:25:27,289 INFO L226 Difference]: Without dead ends: 239 [2018-10-01 00:25:27,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-01 00:25:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-10-01 00:25:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:25:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-10-01 00:25:27,336 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-10-01 00:25:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:27,336 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-10-01 00:25:27,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:25:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-10-01 00:25:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:27,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:27,336 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:27,337 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:27,337 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:27,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-10-01 00:25:27,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:27,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:27,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:27,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:27,431 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:27,431 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-10-01 00:25:27,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:27,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:25:27,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:27,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-10-01 00:25:27,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:27,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:27,506 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-10-01 00:25:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:30,946 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-10-01 00:25:30,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:25:30,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-01 00:25:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:30,949 INFO L225 Difference]: With dead ends: 202 [2018-10-01 00:25:30,949 INFO L226 Difference]: Without dead ends: 198 [2018-10-01 00:25:30,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-01 00:25:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-10-01 00:25:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-01 00:25:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-10-01 00:25:30,999 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-10-01 00:25:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:30,999 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-10-01 00:25:30,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-10-01 00:25:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:25:31,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:31,000 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:31,000 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:31,000 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-10-01 00:25:31,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:31,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:31,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:31,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:31,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:31,105 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:31,105 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-10-01 00:25:31,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:31,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:25:31,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:31,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-01 00:25:31,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:25:31,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:25:31,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:31,237 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 11 states. [2018-10-01 00:25:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:34,385 INFO L93 Difference]: Finished difference Result 179 states and 301 transitions. [2018-10-01 00:25:34,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:25:34,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-01 00:25:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:34,387 INFO L225 Difference]: With dead ends: 179 [2018-10-01 00:25:34,387 INFO L226 Difference]: Without dead ends: 175 [2018-10-01 00:25:34,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-01 00:25:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 68. [2018-10-01 00:25:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-01 00:25:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 118 transitions. [2018-10-01 00:25:34,450 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 118 transitions. Word has length 13 [2018-10-01 00:25:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:34,450 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 118 transitions. [2018-10-01 00:25:34,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:25:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 118 transitions. [2018-10-01 00:25:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-01 00:25:34,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:34,451 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-01 00:25:34,451 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:34,451 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:34,451 INFO L82 PathProgramCache]: Analyzing trace with hash -388508285, now seen corresponding path program 2 times [2018-10-01 00:25:34,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:34,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:34,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:34,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:34,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:25:34,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:34,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:34,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:25:34,602 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:25:34,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:34,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-01 00:25:34,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:34,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-10-01 00:25:34,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:25:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:25:34,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:34,697 INFO L87 Difference]: Start difference. First operand 68 states and 118 transitions. Second operand 12 states. [2018-10-01 00:25:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:40,148 INFO L93 Difference]: Finished difference Result 268 states and 455 transitions. [2018-10-01 00:25:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:25:40,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-10-01 00:25:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:40,149 INFO L225 Difference]: With dead ends: 268 [2018-10-01 00:25:40,149 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:25:40,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:25:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:25:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:25:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:25:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:25:40,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-10-01 00:25:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:40,152 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:25:40,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:25:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:25:40,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:25:40,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:25:40,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:40,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:40,698 WARN L178 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 169 [2018-10-01 00:25:40,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:40,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:40,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:41,314 WARN L178 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 169 [2018-10-01 00:25:41,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:41,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:41,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:41,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:42,686 WARN L178 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 228 DAG size of output: 152 [2018-10-01 00:25:42,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:43,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:43,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:43,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:43,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:43,362 WARN L178 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 229 [2018-10-01 00:25:43,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:43,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:43,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:43,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:44,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:44,203 WARN L178 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 238 [2018-10-01 00:25:44,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:44,849 WARN L178 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 156 [2018-10-01 00:25:44,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:44,973 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 150 [2018-10-01 00:25:45,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,647 WARN L178 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 252 [2018-10-01 00:25:45,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:45,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,064 WARN L178 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 239 [2018-10-01 00:25:46,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,286 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 144 [2018-10-01 00:25:46,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,659 WARN L178 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 278 [2018-10-01 00:25:46,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,972 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 194 [2018-10-01 00:25:46,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:46,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:47,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:47,378 WARN L178 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 212 [2018-10-01 00:25:47,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:47,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:47,869 WARN L178 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 181 [2018-10-01 00:25:47,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:47,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:47,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:47,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:25:48,132 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 169 [2018-10-01 00:25:49,526 WARN L178 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 168 DAG size of output: 43 [2018-10-01 00:25:51,336 WARN L178 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 167 DAG size of output: 42 [2018-10-01 00:25:52,925 WARN L178 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 145 DAG size of output: 39 [2018-10-01 00:25:54,893 WARN L178 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 219 DAG size of output: 66 [2018-10-01 00:25:56,642 WARN L178 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 222 DAG size of output: 47 [2018-10-01 00:25:57,864 WARN L178 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 154 DAG size of output: 40 [2018-10-01 00:25:58,749 WARN L178 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 34 [2018-10-01 00:26:01,304 WARN L178 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 246 DAG size of output: 55 [2018-10-01 00:26:04,837 WARN L178 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 224 DAG size of output: 80 [2018-10-01 00:26:05,528 WARN L178 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 34 [2018-10-01 00:26:07,901 WARN L178 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 271 DAG size of output: 69 [2018-10-01 00:26:10,179 WARN L178 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 188 DAG size of output: 54 [2018-10-01 00:26:12,312 WARN L178 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 196 DAG size of output: 55 [2018-10-01 00:26:13,664 WARN L178 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 180 DAG size of output: 39 [2018-10-01 00:26:14,496 WARN L178 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 32 [2018-10-01 00:26:14,500 INFO L422 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_i_1 1)) (.cse12 (+ product__local__threadpooling_working_1 1)) (.cse5 (+ product__local__threadpooling_working_0 2))) (let ((.cse1 (<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1))) (.cse4 (<= .cse5 product__local__threadpooling_working_1)) (.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= .cse12 product__local__threadpooling_end_1)) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse9)) (.cse6 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)))) (or (and .cse0 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) .cse1 .cse2 .cse3 (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse4) (and (and (<= .cse5 product__global_next) (and (and (and .cse6 .cse1) .cse0) (<= (+ product__local__threadpooling_working_1 2) product__global_next))) .cse7 .cse8) (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1) .cse1 (<= .cse9 product__local__threadpooling_end_1) .cse2 .cse3 .cse4) (let ((.cse11 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse6 (<= .cse9 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse10 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse10 product__global_next) (and .cse11 .cse2 .cse0 .cse3)) (and .cse7 (and (and .cse11 .cse8) (<= .cse12 product__global_next) .cse0) (<= .cse10 product__local__threadpooling_end_0))))))) [2018-10-01 00:26:14,500 INFO L422 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse5 (+ 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 .cse5)) (.cse3 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse5 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse4 (+ product__local__threadpooling_working_0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3) (<= .cse4 product__global_next)) (and .cse0 .cse1 .cse2 (<= .cse5 product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)) (and (and (<= .cse6 product__global_next) .cse1 (and .cse3 (<= (+ 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-10-01 00:26:14,500 INFO L426 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-10-01 00:26:14,500 INFO L422 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse11 (+ product__local__threadpooling_working_1 2)) (.cse12 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse8 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse14 (+ product__local__threadpooling_i_0 1)) (.cse13 (+ product__local__threadpooling_working_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= .cse13 product__local__threadpooling_end_1)) (.cse6 (<= product__local__threadpooling_end_0 .cse14)) (.cse7 (+ product__local__threadpooling_working_0 2)) (.cse5 (<= .cse14 product__global_next)) (.cse9 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (and .cse12 .cse8 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse10 (<= .cse11 product__global_next)) (.cse1 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 (<= .cse1 product__global_next) .cse2 .cse3 .cse4) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse0 .cse2 .cse3 .cse5 .cse6 (<= .cse7 product__local__threadpooling_working_1)) (and (and (or (and .cse8 .cse2 .cse6 .cse9 .cse10) (and (<= .cse11 product__local__threadpooling_i_0) .cse6 .cse9)) (<= .cse7 product__global_next)) .cse5) (and .cse9 (or (and (<= .cse11 product__local__threadpooling_working_0) .cse12) (and (<= .cse13 product__global_next) .cse2 (and (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse4)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse12 .cse2 .cse10)) (<= .cse1 product__local__threadpooling_end_0))))) [2018-10-01 00:26:14,500 INFO L426 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-10-01 00:26:14,501 INFO L426 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-10-01 00:26:14,501 INFO L422 ceAbstractionStarter]: At program point L119(lines 119 124) the Hoare annotation is: (let ((.cse1 (+ product__local__threadpooling_i_0 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse2 (<= product__local__threadpooling_end_0 .cse1)) (.cse4 (+ product__local__threadpooling_working_0 2)) (.cse3 (<= .cse1 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse1 product__global_next) .cse2 .cse3 (<= .cse4 product__local__threadpooling_working_1)) (and (let ((.cse6 (+ product__local__threadpooling_working_1 2)) (.cse5 (= product__local__threadpooling_end_0 product__global_next))) (or (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse0 .cse2 .cse5 (<= .cse6 product__global_next)) (and (<= .cse6 product__local__threadpooling_i_0) .cse2 .cse5))) (<= .cse4 product__global_next) .cse3)))) [2018-10-01 00:26:14,501 INFO L422 ceAbstractionStarter]: At program point L95(lines 95 190) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_working_0 2))) (let ((.cse3 (+ product__local__threadpooling_i_1 1)) (.cse10 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (.cse19 (+ product__local__threadpooling_i_0 1)) (.cse9 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse11 (<= .cse5 product__global_next)) (.cse18 (+ product__local__threadpooling_working_1 2))) (let ((.cse6 (<= .cse18 product__global_next)) (.cse7 (<= .cse18 product__local__threadpooling_i_0)) (.cse4 (= product__local__threadpooling_end_1 product__global_next)) (.cse8 (let ((.cse20 (<= .cse5 product__local__threadpooling_i_1))) (or (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse20 .cse11) (and .cse9 .cse20 .cse11)))) (.cse2 (<= product__local__threadpooling_end_0 .cse19)) (.cse12 (<= .cse19 product__local__threadpooling_end_0)) (.cse1 (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (.cse16 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse9 (<= .cse3 product__global_next)) .cse10)) (.cse13 (= product__local__threadpooling_end_0 product__global_next)) (.cse14 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse3)) (.cse15 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 .cse1 .cse2 (<= .cse3 product__local__threadpooling_end_1) .cse4 (<= .cse5 product__local__threadpooling_working_1) .cse6) (and (or (and .cse7 .cse0 (and (and .cse8 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse2)) (and (and (and (and .cse9 .cse2) .cse10) .cse7 .cse0) .cse11 .cse12)) .cse13 .cse14) (and (<= .cse15 product__global_next) (and .cse16 .cse4 .cse0 .cse6)) (and (let ((.cse17 (and (and (and .cse8 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1)) .cse2) .cse12))) (or (and .cse9 .cse4 .cse0 .cse17 .cse6) (and .cse7 .cse4 .cse0 .cse17))) .cse1) (and (<= .cse18 product__local__threadpooling_working_0) (and .cse16 .cse13 .cse14) .cse0 (<= .cse15 product__local__threadpooling_end_0)))))) [2018-10-01 00:26:14,501 INFO L426 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-10-01 00:26:14,501 INFO L422 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_i_0 1)) (.cse11 (+ product__local__threadpooling_working_1 2))) (let ((.cse4 (<= .cse11 product__local__threadpooling_working_0)) (.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse8 (<= .cse11 product__global_next)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (= product__local__threadpooling_i_0 product__local__threadpooling_working_0)) (.cse7 (= product__local__threadpooling_end_1 product__global_next)) (.cse6 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse1 (<= product__local__threadpooling_end_0 .cse10)) (.cse5 (<= .cse10 product__local__threadpooling_end_0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse5) (and (and (<= (+ product__local__threadpooling_working_0 2) product__global_next) (and (and .cse6 .cse1 .cse5) .cse7 .cse0 .cse8)) (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (let ((.cse9 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and (and (and .cse9 .cse1) .cse8) .cse2 .cse3 .cse5) (and .cse7 .cse6 (<= (+ product__local__threadpooling_working_0 1) product__global_next) .cse9 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse1 (<= .cse10 product__global_next) .cse5)))))) [2018-10-01 00:26:14,501 INFO L422 ceAbstractionStarter]: At program point L154(lines 154 159) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1))) (let ((.cse7 (<= product__local__threadpooling_end_0 .cse4)) (.cse6 (+ product__local__threadpooling_i_1 1))) (let ((.cse2 (<= product__local__threadpooling_end_1 .cse6)) (.cse0 (and .cse7 (<= .cse6 product__global_next))) (.cse3 (+ product__local__threadpooling_working_1 2)) (.cse1 (<= .cse4 product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_1 product__global_next) (and (and .cse0 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) .cse1) .cse2 (<= .cse3 product__global_next)) (<= (+ product__local__threadpooling_working_0 1) product__global_next) (<= .cse4 product__global_next)) (and (let ((.cse5 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (+ product__local__threadpooling_i_1 2))) (or (and .cse2 (and (and .cse5 (<= .cse6 product__local__threadpooling_end_1)) .cse7) (<= .cse8 product__local__threadpooling_end_0)) (and .cse2 .cse0 .cse5 (<= .cse8 product__local__threadpooling_i_0)))) (<= .cse3 product__local__threadpooling_i_0) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse1))))) [2018-10-01 00:26:14,502 INFO L422 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_1 2)) (.cse8 (+ product__local__threadpooling_working_1 1))) (let ((.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= .cse8 product__local__threadpooling_end_1)) (.cse6 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse3 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse1 (<= .cse9 product__global_next)) (.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse7 (+ product__local__threadpooling_working_0 1))) (or (let ((.cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next))) (or (and .cse0 .cse1) (and .cse2 .cse0 .cse3 .cse4))) (and .cse5 .cse6 .cse2 (<= .cse7 product__global_next) .cse3 .cse4) (and (= product__local__threadpooling_end_0 product__global_next) (or (and (<= .cse8 product__global_next) .cse3 (and .cse5 (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse6)) (and .cse5 .cse3 .cse1) (and (<= .cse9 product__local__threadpooling_working_0) .cse5)) (<= .cse7 product__local__threadpooling_end_0))))) [2018-10-01 00:26:14,502 INFO L422 ceAbstractionStarter]: At program point L196(lines 196 201) the Hoare annotation is: (let ((.cse17 (+ product__local__threadpooling_i_0 1)) (.cse19 (+ product__local__threadpooling_i_1 1)) (.cse15 (+ product__local__threadpooling_working_1 2)) (.cse20 (+ product__local__threadpooling_working_0 2))) (let ((.cse9 (<= .cse20 product__local__threadpooling_i_1)) (.cse8 (<= .cse15 product__local__threadpooling_i_0)) (.cse14 (+ product__local__threadpooling_i_1 2)) (.cse4 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse12 (= product__local__threadpooling_end_0 product__global_next)) (.cse13 (<= .cse20 product__global_next)) (.cse10 (+ product__local__threadpooling_i_0 2)) (.cse0 (<= product__local__threadpooling_end_1 .cse19)) (.cse3 (<= product__local__threadpooling_end_0 .cse17)) (.cse5 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse6 (<= .cse17 product__local__threadpooling_end_0)) (.cse18 (<= .cse20 product__local__threadpooling_working_1)) (.cse7 (<= .cse15 product__global_next))) (or (and (and (let ((.cse2 (or (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (and .cse6 (and .cse8 (and .cse2 .cse5) .cse3)) .cse0))) .cse9) (<= .cse10 product__global_next)) (and (let ((.cse11 (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse8 .cse3) .cse0))) (or (and .cse11 .cse4 .cse12 .cse13) (and .cse11 .cse9 .cse12))) (<= .cse14 product__local__threadpooling_end_0)) (and (and (<= .cse15 product__local__threadpooling_working_0) .cse3 .cse0) .cse12 .cse13 .cse6 (<= .cse14 product__local__threadpooling_i_0)) (let ((.cse16 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and .cse5 .cse16 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse17 product__global_next) .cse3 .cse1 .cse6 .cse18) (and (and .cse4 .cse16 .cse3 .cse12 .cse7) .cse13 .cse6))) (and (<= .cse10 product__local__threadpooling_i_1) .cse0 .cse3 (and .cse5 .cse1 (<= .cse19 product__local__threadpooling_end_1)) .cse6 .cse18 .cse7)))) [2018-10-01 00:26:14,502 INFO L426 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-10-01 00:26:14,502 INFO L426 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-10-01 00:26:14,502 INFO L426 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-10-01 00:26:14,502 INFO L422 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse2 (+ product__local__threadpooling_i_0 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse1 (<= product__local__threadpooling_end_0 .cse2)) (.cse3 (<= .cse2 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_0 1) product__global_next) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse1 (<= .cse2 product__global_next) .cse3) (and (let ((.cse4 (+ product__local__threadpooling_working_1 2))) (or (and (<= .cse4 product__local__threadpooling_i_0) .cse1) (and .cse0 .cse1 (<= .cse4 product__global_next)))) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse3)))) [2018-10-01 00:26:14,503 INFO L422 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse1 (+ product__local__threadpooling_i_0 1)) (.cse3 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 .cse3)) (.cse4 (<= product__local__threadpooling_end_0 .cse1)) (.cse2 (<= .cse1 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse1 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse2 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (<= .cse3 product__global_next) .cse4)) (and (and .cse0 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0) .cse4 (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse2)))) [2018-10-01 00:26:14,503 INFO L422 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_i_1 1)) (.cse15 (+ product__local__threadpooling_working_0 1)) (.cse14 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= .cse14 product__local__threadpooling_working_0)) (.cse3 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= .cse15 product__local__threadpooling_end_0)) (.cse6 (+ product__local__threadpooling_working_0 2)) (.cse12 (<= .cse15 product__global_next)) (.cse9 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse2 (<= product__local__threadpooling_end_1 .cse7)) (.cse8 (<= .cse14 product__global_next))) (or (and (and .cse0 (and .cse1 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse2) .cse3 .cse4) (and .cse5 (<= .cse6 product__local__threadpooling_i_1) .cse2 (<= .cse7 product__local__threadpooling_end_1) .cse8) (and .cse1 .cse2 .cse3 .cse0 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse4) (let ((.cse11 (+ product__local__threadpooling_working_1 1))) (let ((.cse10 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse13 (<= .cse11 product__local__threadpooling_end_1))) (or (and .cse3 (or (and (and .cse1 (<= .cse7 product__global_next) .cse9 .cse10) (<= .cse11 product__global_next)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1 .cse10 .cse8)) .cse4) (and .cse1 .cse9 .cse5 .cse12 .cse10 .cse13) (and .cse5 .cse10 .cse13 (<= .cse6 product__local__threadpooling_working_1))))) (and .cse12 (and (and .cse9 .cse5) .cse1 .cse2 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse8))))) [2018-10-01 00:26:14,503 INFO L422 ceAbstractionStarter]: At program point L207(lines 207 212) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_1 1)) (.cse6 (+ product__local__threadpooling_i_0 1)) (.cse7 (+ product__local__threadpooling_working_0 2))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse7 product__local__threadpooling_working_1)) (.cse2 (<= product__local__threadpooling_end_0 .cse6)) (.cse1 (<= product__local__threadpooling_end_1 .cse4)) (.cse3 (<= .cse6 product__local__threadpooling_end_0))) (or (and (and .cse0 .cse1 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse2 .cse3 (<= .cse4 product__local__threadpooling_end_1) .cse5) (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1)) (or (and .cse0 (and (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (not (= product__local__threadpooling_working_1 product__global_next))) .cse1 (<= .cse6 product__global_next) .cse2 .cse3 .cse5) (and (and (and (and .cse2 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) .cse1) (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse7 product__global_next) .cse3))))) [2018-10-01 00:26:14,503 INFO L422 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse7 (+ product__local__threadpooling_working_0 1)) (.cse27 (+ product__local__threadpooling_i_1 2)) (.cse28 (+ product__local__threadpooling_i_0 1)) (.cse30 (+ product__local__threadpooling_working_0 2)) (.cse13 (+ product__local__threadpooling_i_1 1)) (.cse29 (+ product__local__threadpooling_working_1 2)) (.cse12 (+ product__local__threadpooling_working_1 1))) (let ((.cse10 (<= .cse12 product__local__threadpooling_end_1)) (.cse21 (<= .cse29 product__local__threadpooling_i_0)) (.cse20 (<= .cse13 product__local__threadpooling_end_1)) (.cse17 (<= .cse30 product__local__threadpooling_i_1)) (.cse23 (<= .cse28 product__global_next)) (.cse18 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse24 (<= .cse30 product__local__threadpooling_working_1)) (.cse5 (<= .cse27 product__local__threadpooling_working_0)) (.cse11 (<= .cse7 product__local__threadpooling_end_0)) (.cse9 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse14 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse15 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse6 (= product__local__threadpooling_end_1 product__global_next)) (.cse16 (<= .cse29 product__global_next)) (.cse2 (<= .cse30 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 .cse13)) (.cse26 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse1 (<= product__local__threadpooling_end_0 .cse28)) (.cse3 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= .cse29 product__local__threadpooling_working_0)) (.cse22 (<= .cse28 product__local__threadpooling_end_0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse8 (and .cse14 .cse15 (not (= product__local__threadpooling_working_1 product__global_next))))) (or (and .cse6 (<= .cse7 product__global_next) .cse8 .cse9 .cse10) (and .cse3 .cse11 (or (and (<= .cse12 product__global_next) (and (<= .cse13 product__global_next) .cse8 .cse9)) (and .cse14 .cse15 .cse9 .cse16))))) (and .cse17 (let ((.cse19 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse15 .cse6 .cse0 .cse18 .cse19 .cse1 .cse20 .cse16) (and .cse21 .cse6 .cse0 .cse19 .cse1 .cse22 .cse20)))) (and .cse18 .cse6 .cse9 .cse10 .cse23 .cse1 .cse24) (and (let ((.cse25 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))) (or (and .cse21 .cse0 .cse2 .cse1 .cse3 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse15 .cse25) (and .cse21 .cse0 .cse1 .cse3 .cse20 .cse17 .cse25))) .cse23) (and .cse14 .cse0 .cse26 .cse3 .cse4 .cse11) (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__global_next) .cse1 (and .cse6 .cse18) .cse24 .cse16) (and .cse14 .cse0 .cse3 .cse4 .cse5 .cse11) (and (and .cse15 .cse9 .cse1 .cse3 .cse16) .cse2) (and (and (and .cse14 .cse15 .cse6) .cse0 .cse16) .cse2) (and .cse0 .cse26 .cse1 .cse3 (<= .cse27 product__local__threadpooling_i_0) .cse4 .cse22)))) [2018-10-01 00:26:14,504 INFO L426 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-10-01 00:26:14,504 INFO L426 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-10-01 00:26:14,504 INFO L422 ceAbstractionStarter]: At program point L43(lines 43 48) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_working_1 2)) (.cse2 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_1 .cse2)) (.cse3 (<= .cse4 product__global_next))) (or (and .cse0 (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3) (let ((.cse6 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse2 product__global_next)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))))) (.cse5 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse4 product__local__threadpooling_working_0) .cse1 (= product__local__threadpooling_end_0 product__global_next) (<= .cse5 product__local__threadpooling_end_0) (and .cse6 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0))) (and (and .cse0 .cse1 .cse6 .cse3) (<= .cse5 product__global_next))))))) [2018-10-01 00:26:14,539 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:26:14 BoogieIcfgContainer [2018-10-01 00:26:14,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:26:14,541 INFO L168 Benchmark]: Toolchain (without parser) took 91721.64 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 534.2 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 310.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-01 00:26:14,542 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 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-10-01 00:26:14,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:26:14,543 INFO L168 Benchmark]: Boogie Preprocessor took 37.05 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-10-01 00:26:14,546 INFO L168 Benchmark]: RCFGBuilder took 565.89 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-10-01 00:26:14,547 INFO L168 Benchmark]: TraceAbstraction took 91064.15 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 534.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 288.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-01 00:26:14,554 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.26 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 45.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.05 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 565.89 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 91064.15 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 534.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 288.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 181]: 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: 60]: 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_i_0 + 2 <= _local__threadpooling_working_1) || ((((((_local__threadpooling_end_1 == _global_next && (_local__threadpooling_end_0 == _local__threadpooling_working_1 && _local__threadpooling_end_0 == _local__threadpooling_i_1) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || ((((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 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) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: (((((_local__threadpooling_end_1 == _global_next && ((_local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _global_next) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && (_local__threadpooling_end_0 == _global_next && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) || (((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1 && _local__threadpooling_i_1 + 1 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_i_0)) && _local__threadpooling_working_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_working_0 + 2 <= _global_next && _local__threadpooling_working_1 + 2 <= _global_next) || (((_local__threadpooling_end_1 == _global_next && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1)) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1)) || ((_local__threadpooling_end_0 == _global_next && ((((_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_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0))) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && (_local__threadpooling_end_0 == _local__threadpooling_i_1 || _local__threadpooling_end_0 == _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 == _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 2 <= _global_next) || ((_local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0 && (_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && (_local__threadpooling_end_0 == _local__threadpooling_i_1 || _local__threadpooling_end_0 == _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1)) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_i_0 + 2 <= _global_next) || ((((((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) || (((((_local__threadpooling_end_1 == _local__threadpooling_i_0 && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 == _global_next)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || ((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _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_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_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || ((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) || ((((((_local__threadpooling_i_0 + 2 <= _local__threadpooling_i_1 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && (_local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _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_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_i_1 + 2 <= _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_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _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_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 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _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_working_0 + 2 <= _global_next && ((((!(_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_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_i_0 + 2 <= _global_next)) || (((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((((_local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((_local__threadpooling_end_1 == _global_next && _local__threadpooling_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_working_0 == _local__threadpooling_working_1) && _local__threadpooling_i_1 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((((((_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 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _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_end_1 == _global_next && _local__threadpooling_working_0 + 1 <= _global_next) && (_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) || ((_local__threadpooling_end_0 == _global_next && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) && ((_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_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 + 2 <= _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_1) && _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_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_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1)))) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || (((((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _local__threadpooling_i_0) || ((((((_local__threadpooling_working_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_0 == _global_next) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_end_1 == _local__threadpooling_i_0)) && _local__threadpooling_i_0 + 1 <= _global_next)) || (((((_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_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_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_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_end_0 == _global_next) && _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_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_working_0 + 2 <= _global_next)) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _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) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((_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_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 == _local__threadpooling_working_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || (((_local__threadpooling_working_0 + 2 <= _global_next && ((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || ((((((_local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || (_local__threadpooling_working_0 + 1 <= _global_next && (((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && (!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_1 == _global_next)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) || ((_local__threadpooling_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_1 == _global_next)) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_working_1 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((_local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) || (((((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_0 == _global_next) && _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_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - 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 <= _local__threadpooling_i_1 + 1) && ((((!(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((!(_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_end_1 == _local__threadpooling_i_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0) && _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_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0)) || (_local__threadpooling_working_0 + 1 <= _global_next && ((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_1 + 2 <= _global_next)) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (((((!(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((!(_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_end_0 == _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_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && (((((!(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_i_1) && _local__threadpooling_working_0 + 2 <= _global_next) || ((!(_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_end_0 == _local__threadpooling_i_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0)) && _local__threadpooling_i_0 + 2 <= _global_next)) || (((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_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_end_0 == _global_next) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_end_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) - 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_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && !(_local__threadpooling_working_1 == _global_next)) || ((((((!(_local__threadpooling_working_1 == _local__threadpooling_i_0) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_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_end_0 == _global_next) && _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_working_0 + 2 <= _global_next) && _local__threadpooling_i_0 + 1 <= _global_next)) || ((_local__threadpooling_end_0 == _global_next && (((_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_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_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_working_0 + 1 <= _local__threadpooling_end_0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 == _local__threadpooling_working_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0) || ((((_local__threadpooling_end_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_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (((_local__threadpooling_end_0 == _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_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_working_0 + 1 <= _local__threadpooling_end_0) || (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1)) || (((_local__threadpooling_end_1 == _global_next && _local__threadpooling_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_working_0 + 1 <= _global_next && ((((!(_local__threadpooling_working_0 == _local__threadpooling_working_1) && _local__threadpooling_end_1 == _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0) && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && !(_local__threadpooling_working_0 == _local__threadpooling_i_1)) && _local__threadpooling_working_1 + 2 <= _global_next) - 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_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_working_0 + 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_i_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_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_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_working_0)) && _local__threadpooling_working_0 + 1 <= _global_next) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_i_0 + 1 <= _global_next) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) || (((((_local__threadpooling_working_1 + 2 <= _local__threadpooling_i_0 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) || ((_local__threadpooling_end_1 <= _local__threadpooling_i_1 && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_working_1 + 2 <= _global_next)) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_i_0 == _local__threadpooling_working_0) && _local__threadpooling_i_0 + 1 <= _local__threadpooling_end_0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 6 error locations. SAFE Result, 90.9s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 51.4s AutomataDifference, 0.0s DeadEndRemovalTime, 34.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 762 SDtfs, 2229 SDslu, 1186 SDs, 0 SdLazy, 9019 SolverSat, 1299 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s 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, 17 MinimizatonAttempts, 1621 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 278 NumberOfFragments, 2635 HoareAnnotationTreeSize, 15 FomulaSimplifications, 570982609948 FormulaSimplificationTreeSizeReduction, 7.9s HoareSimplificationTime, 15 FomulaSimplificationsInter, 791433145 FormulaSimplificationTreeSizeReductionInter, 26.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 14623 SizeOfPredicates, 32 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 75/135 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-26-14-583.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-26-14-583.csv Received shutdown request...