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-09-30 20:34:15,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:34:15,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:34:15,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:34:15,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:34:15,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:34:15,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:34:15,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:34:15,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:34:15,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:34:15,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:34:15,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:34:15,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:34:15,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:34:15,128 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:34:15,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:34:15,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:34:15,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:34:15,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:34:15,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:34:15,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:34:15,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:34:15,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:34:15,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:34:15,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:34:15,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:34:15,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:34:15,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:34:15,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:34:15,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:34:15,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:34:15,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:34:15,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:34:15,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:34:15,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:34:15,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:34:15,150 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-09-30 20:34:15,165 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:34:15,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:34:15,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:34:15,167 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:34:15,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:34:15,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:34:15,168 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:34:15,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:34:15,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:34:15,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:34:15,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:34:15,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:34:15,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:34:15,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:34:15,169 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:34:15,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:34:15,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:34:15,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:34:15,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:34:15,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:34:15,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:34:15,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:34:15,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:15,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:34:15,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:34:15,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:34:15,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:34:15,172 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:34:15,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:34:15,172 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:34:15,172 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:34:15,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:34:15,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:34:15,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:34:15,251 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:34:15,252 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:34:15,252 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl [2018-09-30 20:34:15,253 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-09-30 20:34:15,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:34:15,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:34:15,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:15,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:34:15,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:34:15,341 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 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,355 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 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,360 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:34:15,360 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:34:15,360 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:34:15,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:15,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:34:15,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:34:15,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:34:15,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... [2018-09-30 20:34:15,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:34:15,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:34:15,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:34:15,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:34:15,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:15,484 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:34:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:34:15,485 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:34:15,946 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:34:15,947 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:15 BoogieIcfgContainer [2018-09-30 20:34:15,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:34:15,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:34:15,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:34:15,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:34:15,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:15" (1/2) ... [2018-09-30 20:34:15,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c512f78 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:34:15, skipping insertion in model container [2018-09-30 20:34:15,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:15" (2/2) ... [2018-09-30 20:34:15,957 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-09-30 20:34:15,967 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:34:15,976 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-09-30 20:34:16,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:34:16,029 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:34:16,029 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:34:16,029 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:34:16,029 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:34:16,029 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:34:16,030 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:34:16,030 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:34:16,030 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:34:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-30 20:34:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:16,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:16,062 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:16,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:16,068 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-09-30 20:34:16,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:16,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:16,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:16,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:16,321 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:16,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:16,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:16,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:16,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:16,338 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-09-30 20:34:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:18,286 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-09-30 20:34:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:34:18,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:34:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:18,310 INFO L225 Difference]: With dead ends: 46 [2018-09-30 20:34:18,311 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 20:34:18,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 20:34:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-09-30 20:34:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 20:34:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-09-30 20:34:18,363 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-09-30 20:34:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:18,363 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-09-30 20:34:18,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-09-30 20:34:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:18,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:18,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:18,366 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:18,366 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-09-30 20:34:18,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:18,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:18,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:18,444 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:18,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:18,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:18,447 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:18,447 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-09-30 20:34:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:19,538 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-09-30 20:34:19,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:34:19,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:34:19,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:19,543 INFO L225 Difference]: With dead ends: 75 [2018-09-30 20:34:19,545 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 20:34:19,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 20:34:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-09-30 20:34:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 20:34:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-09-30 20:34:19,573 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-09-30 20:34:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:19,574 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-09-30 20:34:19,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-09-30 20:34:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:19,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:19,575 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:19,577 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:19,578 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-09-30 20:34:19,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:19,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:19,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:19,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:19,732 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:19,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:19,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:19,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:19,733 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:19,733 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-09-30 20:34:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:22,690 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-09-30 20:34:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:34:22,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:22,694 INFO L225 Difference]: With dead ends: 198 [2018-09-30 20:34:22,694 INFO L226 Difference]: Without dead ends: 147 [2018-09-30 20:34:22,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-30 20:34:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-09-30 20:34:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 20:34:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-09-30 20:34:22,723 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-09-30 20:34:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:22,723 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-09-30 20:34:22,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-09-30 20:34:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:22,725 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:22,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:22,725 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:22,726 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:22,726 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-09-30 20:34:22,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:22,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:22,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:22,813 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:22,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:22,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:22,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:22,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:22,814 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-09-30 20:34:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:25,856 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-09-30 20:34:25,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:34:25,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:25,860 INFO L225 Difference]: With dead ends: 227 [2018-09-30 20:34:25,860 INFO L226 Difference]: Without dead ends: 223 [2018-09-30 20:34:25,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-30 20:34:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-09-30 20:34:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-30 20:34:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-09-30 20:34:25,889 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-09-30 20:34:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:25,889 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-09-30 20:34:25,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-09-30 20:34:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:25,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:25,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:25,891 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:25,892 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:25,892 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-09-30 20:34:25,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:25,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:25,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:25,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:25,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:25,969 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:25,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:25,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:25,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:25,969 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:25,970 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-09-30 20:34:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:29,008 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-09-30 20:34:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:34:29,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:29,019 INFO L225 Difference]: With dead ends: 286 [2018-09-30 20:34:29,020 INFO L226 Difference]: Without dead ends: 282 [2018-09-30 20:34:29,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:34:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-30 20:34:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-09-30 20:34:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-30 20:34:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-09-30 20:34:29,093 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-09-30 20:34:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:29,099 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-09-30 20:34:29,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-09-30 20:34:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:29,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:29,102 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:29,103 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:29,103 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:29,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-09-30 20:34:29,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:29,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:29,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:29,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:29,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:29,490 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:29,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:29,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:29,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:29,492 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-09-30 20:34:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:32,601 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-09-30 20:34:32,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:34:32,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:32,604 INFO L225 Difference]: With dead ends: 351 [2018-09-30 20:34:32,604 INFO L226 Difference]: Without dead ends: 347 [2018-09-30 20:34:32,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:34:32,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-30 20:34:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-09-30 20:34:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 20:34:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-09-30 20:34:32,655 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-09-30 20:34:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:32,655 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-09-30 20:34:32,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-09-30 20:34:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:32,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:32,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:32,657 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:32,657 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-09-30 20:34:32,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:32,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:32,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:32,825 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:32,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:32,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:32,826 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:32,826 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-09-30 20:34:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:35,087 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-09-30 20:34:35,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:34:35,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:35,092 INFO L225 Difference]: With dead ends: 353 [2018-09-30 20:34:35,092 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 20:34:35,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:34:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 20:34:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-09-30 20:34:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-30 20:34:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-09-30 20:34:35,152 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-09-30 20:34:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:35,152 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-09-30 20:34:35,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-09-30 20:34:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:35,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:35,154 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 20:34:35,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:35,155 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:35,155 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-09-30 20:34:35,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:35,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:35,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:35,219 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:35,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:35,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:35,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:35,712 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:34:35,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2018-09-30 20:34:35,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:35,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:35,713 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:35,713 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-09-30 20:34:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:38,329 INFO L93 Difference]: Finished difference Result 396 states and 923 transitions. [2018-09-30 20:34:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:34:38,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:34:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:38,336 INFO L225 Difference]: With dead ends: 396 [2018-09-30 20:34:38,336 INFO L226 Difference]: Without dead ends: 242 [2018-09-30 20:34:38,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:34:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-30 20:34:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-09-30 20:34:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 20:34:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-09-30 20:34:38,395 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-09-30 20:34:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:38,395 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-09-30 20:34:38,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-09-30 20:34:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:38,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:38,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:38,397 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:38,397 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-09-30 20:34:38,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:38,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:38,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:38,673 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:38,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:38,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:38,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:38,674 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-09-30 20:34:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:40,410 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-09-30 20:34:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:34:40,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:40,422 INFO L225 Difference]: With dead ends: 383 [2018-09-30 20:34:40,423 INFO L226 Difference]: Without dead ends: 379 [2018-09-30 20:34:40,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-30 20:34:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-09-30 20:34:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-30 20:34:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-09-30 20:34:40,507 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-09-30 20:34:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:40,508 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-09-30 20:34:40,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-09-30 20:34:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:34:40,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:40,509 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:40,510 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:40,510 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-09-30 20:34:40,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:40,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:40,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:40,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:40,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:41,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:41,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:41,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:41,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:41,408 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:34:41,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-09-30 20:34:41,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:34:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:34:41,409 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:41,410 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 9 states. [2018-09-30 20:34:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:44,570 INFO L93 Difference]: Finished difference Result 648 states and 1427 transitions. [2018-09-30 20:34:44,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:34:44,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-09-30 20:34:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:44,573 INFO L225 Difference]: With dead ends: 648 [2018-09-30 20:34:44,573 INFO L226 Difference]: Without dead ends: 399 [2018-09-30 20:34:44,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-09-30 20:34:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-30 20:34:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 286. [2018-09-30 20:34:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-30 20:34:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 584 transitions. [2018-09-30 20:34:44,665 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 584 transitions. Word has length 10 [2018-09-30 20:34:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:44,666 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 584 transitions. [2018-09-30 20:34:44,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:34:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 584 transitions. [2018-09-30 20:34:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:34:44,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:44,667 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:44,667 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:44,668 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:44,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-09-30 20:34:44,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:44,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:44,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:44,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:44,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:44,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:44,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:44,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:34:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:34:44,884 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:44,884 INFO L87 Difference]: Start difference. First operand 286 states and 584 transitions. Second operand 4 states. [2018-09-30 20:34:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:45,533 INFO L93 Difference]: Finished difference Result 471 states and 962 transitions. [2018-09-30 20:34:45,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:34:45,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-09-30 20:34:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:45,535 INFO L225 Difference]: With dead ends: 471 [2018-09-30 20:34:45,535 INFO L226 Difference]: Without dead ends: 212 [2018-09-30 20:34:45,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-30 20:34:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2018-09-30 20:34:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-30 20:34:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 321 transitions. [2018-09-30 20:34:45,602 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 321 transitions. Word has length 11 [2018-09-30 20:34:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:45,603 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 321 transitions. [2018-09-30 20:34:45,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:34:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 321 transitions. [2018-09-30 20:34:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:34:45,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:45,604 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:45,604 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:45,604 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-09-30 20:34:45,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:45,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:45,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:45,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:45,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:45,846 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:45,846 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:45,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:45,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:45,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:45,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-09-30 20:34:45,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:34:45,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:34:45,975 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:45,975 INFO L87 Difference]: Start difference. First operand 175 states and 321 transitions. Second operand 12 states. [2018-09-30 20:34:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:49,630 INFO L93 Difference]: Finished difference Result 253 states and 430 transitions. [2018-09-30 20:34:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:34:49,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-30 20:34:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:49,631 INFO L225 Difference]: With dead ends: 253 [2018-09-30 20:34:49,632 INFO L226 Difference]: Without dead ends: 249 [2018-09-30 20:34:49,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:34:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-30 20:34:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 121. [2018-09-30 20:34:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 20:34:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-09-30 20:34:49,682 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 212 transitions. Word has length 11 [2018-09-30 20:34:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:49,682 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-09-30 20:34:49,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:34:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 212 transitions. [2018-09-30 20:34:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:34:49,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:49,683 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:49,684 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:49,684 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:49,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-09-30 20:34:49,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:49,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:49,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:49,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:50,185 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:50,185 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:50,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:50,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:50,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:50,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-09-30 20:34:50,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:34:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:34:50,305 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:50,305 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. Second operand 13 states. [2018-09-30 20:34:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:53,116 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2018-09-30 20:34:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:34:53,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 20:34:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:53,118 INFO L225 Difference]: With dead ends: 229 [2018-09-30 20:34:53,118 INFO L226 Difference]: Without dead ends: 225 [2018-09-30 20:34:53,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-09-30 20:34:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-30 20:34:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-09-30 20:34:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-30 20:34:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-09-30 20:34:53,170 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 11 [2018-09-30 20:34:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:53,170 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-09-30 20:34:53,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:34:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-09-30 20:34:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:34:53,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:53,171 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:53,171 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:53,172 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-09-30 20:34:53,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:53,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:53,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:53,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:53,266 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-09-30 20:34:53,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:53,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:34:53,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:53,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-09-30 20:34:53,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:34:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:34:53,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:53,390 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-09-30 20:34:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:58,187 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-09-30 20:34:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:34:58,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-30 20:34:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:58,190 INFO L225 Difference]: With dead ends: 243 [2018-09-30 20:34:58,190 INFO L226 Difference]: Without dead ends: 239 [2018-09-30 20:34:58,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:34:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-30 20:34:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-09-30 20:34:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 20:34:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-09-30 20:34:58,239 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-09-30 20:34:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:58,240 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-09-30 20:34:58,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:34:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-09-30 20:34:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:34:58,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:58,240 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:58,241 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:58,241 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-09-30 20:34:58,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:58,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:58,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:58,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:58,333 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:34:58,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:58,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:34:58,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:58,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-09-30 20:34:58,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:34:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:34:58,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:58,444 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-09-30 20:35:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:01,622 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-09-30 20:35:01,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:35:01,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-30 20:35:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:01,624 INFO L225 Difference]: With dead ends: 202 [2018-09-30 20:35:01,625 INFO L226 Difference]: Without dead ends: 198 [2018-09-30 20:35:01,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:35:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-30 20:35:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-09-30 20:35:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-30 20:35:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-09-30 20:35:01,665 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-09-30 20:35:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:01,665 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-09-30 20:35:01,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-09-30 20:35:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:35:01,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:01,666 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:01,666 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:01,666 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:01,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-09-30 20:35:01,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:01,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:01,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:01,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:01,755 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:01,755 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:01,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:01,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:35:01,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:01,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-09-30 20:35:01,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:35:01,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:35:01,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:01,841 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 10 states. [2018-09-30 20:35:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:05,470 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2018-09-30 20:35:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:35:05,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-30 20:35:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:05,471 INFO L225 Difference]: With dead ends: 188 [2018-09-30 20:35:05,472 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:35:05,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:35:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:35:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:35:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:35:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:35:05,474 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-09-30 20:35:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:05,474 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:35:05,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:35:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:35:05,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:35:05,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:35:05,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:05,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:05,904 WARN L178 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 151 [2018-09-30 20:35:05,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:06,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:06,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:06,265 WARN L178 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 144 [2018-09-30 20:35:06,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:06,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:06,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:06,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,145 WARN L178 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 134 [2018-09-30 20:35:07,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,595 WARN L178 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 205 [2018-09-30 20:35:07,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:07,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:08,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:08,229 WARN L178 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 203 [2018-09-30 20:35:08,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:08,821 WARN L178 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 138 [2018-09-30 20:35:08,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:08,944 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2018-09-30 20:35:09,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,458 WARN L178 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 225 [2018-09-30 20:35:09,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,746 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 207 [2018-09-30 20:35:09,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:09,978 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 124 [2018-09-30 20:35:09,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,357 WARN L178 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 252 [2018-09-30 20:35:10,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,632 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 169 [2018-09-30 20:35:10,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:10,954 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 186 [2018-09-30 20:35:10,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:11,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:11,299 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 159 [2018-09-30 20:35:11,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:11,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:11,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:11,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:35:11,495 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 143 [2018-09-30 20:35:12,846 WARN L178 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 150 DAG size of output: 43 [2018-09-30 20:35:14,300 WARN L178 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 142 DAG size of output: 42 [2018-09-30 20:35:15,433 WARN L178 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 127 DAG size of output: 39 [2018-09-30 20:35:16,998 WARN L178 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 195 DAG size of output: 67 [2018-09-30 20:35:18,785 WARN L178 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 187 DAG size of output: 47 [2018-09-30 20:35:19,677 WARN L178 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 40 [2018-09-30 20:35:20,387 WARN L178 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 34 [2018-09-30 20:35:22,300 WARN L178 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 219 DAG size of output: 55 [2018-09-30 20:35:24,883 WARN L178 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 193 DAG size of output: 79 [2018-09-30 20:35:25,446 WARN L178 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 34 [2018-09-30 20:35:27,560 WARN L178 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 246 DAG size of output: 69 [2018-09-30 20:35:29,248 WARN L178 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 163 DAG size of output: 54 [2018-09-30 20:35:30,860 WARN L178 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 170 DAG size of output: 54 [2018-09-30 20:35:31,956 WARN L178 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 158 DAG size of output: 39 [2018-09-30 20:35:32,671 WARN L178 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 32 [2018-09-30 20:35:32,674 INFO L422 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse2 (+ product__local__threadpooling_i_1 1)) (.cse12 (+ product__local__threadpooling_working_1 1)) (.cse6 (+ product__local__threadpooling_working_0 2))) (let ((.cse5 (<= .cse6 product__local__threadpooling_working_1)) (.cse1 (<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1))) (.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= .cse12 product__local__threadpooling_end_1)) (.cse8 (= product__local__threadpooling_end_0 product__global_next)) (.cse9 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse2)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)))) (or (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3 .cse4 .cse5) (and .cse0 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) .cse1 .cse3 .cse4 (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse5) (and (and (<= .cse6 product__global_next) (and (and (and .cse7 .cse1) .cse0) (<= (+ product__local__threadpooling_working_1 2) product__global_next))) .cse8 .cse9) (let ((.cse11 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse7 (<= .cse2 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 .cse3 .cse0 .cse4)) (and .cse8 (and (and .cse11 .cse9) (<= .cse12 product__global_next) .cse0) (<= .cse10 product__local__threadpooling_end_0))))))) [2018-09-30 20:35:32,674 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-09-30 20:35:32,674 INFO L426 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-09-30 20:35:32,675 INFO L422 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_1 2)) (.cse12 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse5 (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)) (.cse11 (<= .cse14 product__global_next)) (.cse6 (<= product__local__threadpooling_end_0 .cse14)) (.cse10 (+ product__local__threadpooling_working_0 2)) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (and .cse12 .cse5 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse8 (<= .cse9 product__global_next)) (.cse1 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 (<= .cse1 product__global_next) .cse2 .cse3 .cse4) (and (and (or (and .cse5 .cse2 .cse6 .cse7 .cse8) (and (<= .cse9 product__local__threadpooling_i_0) .cse6 .cse7)) (<= .cse10 product__global_next)) .cse11) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse0 .cse2 .cse3 .cse11 .cse6 (<= .cse10 product__local__threadpooling_working_1)) (and .cse7 (or (and (<= .cse9 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 .cse8)) (<= .cse1 product__local__threadpooling_end_0))))) [2018-09-30 20:35:32,675 INFO L426 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-09-30 20:35:32,675 INFO L426 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-09-30 20:35:32,675 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-09-30 20:35:32,675 INFO L422 ceAbstractionStarter]: At program point L95(lines 95 190) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_working_0 2)) (.cse2 (+ product__local__threadpooling_i_1 1))) (let ((.cse17 (<= .cse2 product__global_next)) (.cse9 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (.cse19 (+ product__local__threadpooling_i_0 1)) (.cse8 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse10 (<= .cse4 product__global_next)) (.cse18 (+ product__local__threadpooling_working_1 2))) (let ((.cse5 (<= .cse18 product__global_next)) (.cse6 (<= .cse18 product__local__threadpooling_i_0)) (.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse7 (let ((.cse20 (<= .cse4 product__local__threadpooling_i_1))) (or (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse20 .cse10) (and .cse8 .cse20 .cse10)))) (.cse1 (<= product__local__threadpooling_end_0 .cse19)) (.cse11 (<= .cse19 product__local__threadpooling_end_0)) (.cse15 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse8 .cse17) .cse9)) (.cse12 (= product__local__threadpooling_end_0 product__global_next)) (.cse13 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse2)) (.cse14 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__global_next) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3 (<= .cse4 product__local__threadpooling_working_1) .cse5) (and (or (and .cse6 .cse0 (and (and .cse7 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse1)) (and (and (and (and .cse8 .cse1) .cse9) .cse6 .cse0) .cse10 .cse11)) .cse12 .cse13) (and (<= .cse14 product__global_next) (and .cse15 .cse3 .cse0 .cse5)) (let ((.cse16 (and (and (and (and .cse17 .cse7) (= product__local__threadpooling_end_0 product__local__threadpooling_i_1)) .cse1) .cse11))) (or (and .cse8 .cse3 .cse0 .cse16 .cse5) (and .cse6 .cse3 .cse0 .cse16))) (and (<= .cse18 product__local__threadpooling_working_0) (and .cse15 .cse12 .cse13) .cse0 (<= .cse14 product__local__threadpooling_end_0)))))) [2018-09-30 20:35:32,675 INFO L426 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-09-30 20:35:32,676 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 ((.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse4 (<= .cse11 product__local__threadpooling_working_0)) (.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 (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)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse5) (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-09-30 20:35:32,676 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-09-30 20:35:32,676 INFO L422 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (.cse1 (<= .cse9 product__global_next))) (or (and .cse0 .cse1) (let ((.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)) (.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse7 (+ product__local__threadpooling_working_0 1))) (or (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-09-30 20:35:32,676 INFO L426 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-09-30 20:35:32,677 INFO L422 ceAbstractionStarter]: At program point L196(lines 196 201) the Hoare annotation is: (let ((.cse13 (+ product__local__threadpooling_i_0 1)) (.cse19 (+ product__local__threadpooling_i_1 1)) (.cse9 (+ product__local__threadpooling_working_1 2)) (.cse20 (+ product__local__threadpooling_working_0 2))) (let ((.cse8 (+ product__local__threadpooling_i_1 2)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= .cse20 product__global_next)) (.cse1 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (<= .cse9 product__local__threadpooling_i_0)) (.cse4 (<= .cse20 product__local__threadpooling_i_1)) (.cse7 (<= product__local__threadpooling_end_1 .cse19)) (.cse6 (<= product__local__threadpooling_end_0 .cse13)) (.cse11 (= product__local__threadpooling_end_1 product__global_next)) (.cse14 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse10 (<= .cse13 product__local__threadpooling_end_0)) (.cse15 (<= .cse20 product__local__threadpooling_working_1)) (.cse16 (<= .cse9 product__global_next))) (or (and (let ((.cse0 (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse5 .cse6) .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2))) (<= .cse8 product__local__threadpooling_end_0)) (and (and (<= .cse9 product__local__threadpooling_working_0) .cse6 .cse7) .cse2 .cse3 .cse10 (<= .cse8 product__local__threadpooling_i_0)) (let ((.cse12 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and .cse11 .cse12 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse13 product__global_next) .cse6 .cse14 .cse10 .cse15) (and (and .cse1 .cse12 .cse6 .cse2 .cse16) .cse3 .cse10))) (let ((.cse18 (+ product__local__threadpooling_i_0 2))) (or (and (and (let ((.cse17 (or (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)))) (or (and .cse7 .cse14 .cse17 .cse6 .cse1 .cse11 .cse10 .cse16) (and (and .cse10 (and .cse5 (and .cse17 .cse11) .cse6)) .cse7))) .cse4) (<= .cse18 product__global_next)) (and (<= .cse18 product__local__threadpooling_i_1) .cse7 .cse6 (and .cse11 .cse14 (<= .cse19 product__local__threadpooling_end_1)) .cse10 .cse15 .cse16)))))) [2018-09-30 20:35:32,677 INFO L426 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-09-30 20:35:32,677 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-09-30 20:35:32,677 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-09-30 20:35:32,677 INFO L422 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_i_1 1)) (.cse11 (+ product__local__threadpooling_working_1 1)) (.cse13 (+ 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 (<= .cse13 product__local__threadpooling_end_0)) (.cse6 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse7 (<= .cse11 product__local__threadpooling_end_1)) (.cse8 (+ product__local__threadpooling_working_0 2)) (.cse10 (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 .cse9)) (.cse12 (<= .cse14 product__global_next))) (or (and (and .cse0 (and .cse1 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse2) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse0 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse4) (and .cse5 .cse6 .cse7 (<= .cse8 product__local__threadpooling_working_1)) (and .cse3 (or (and (and .cse1 (<= .cse9 product__global_next) .cse10 .cse6) (<= .cse11 product__global_next)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1 .cse6 .cse12)) .cse4) (and .cse1 .cse10 .cse5 (<= .cse13 product__global_next) .cse6 .cse7) (or (and .cse5 (<= .cse8 product__local__threadpooling_i_1) .cse2 (<= .cse9 product__local__threadpooling_end_1) .cse12) (and (<= .cse8 product__global_next) (and (and .cse10 .cse5) .cse1 .cse2 .cse12)))))) [2018-09-30 20:35:32,678 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-09-30 20:35:32,678 INFO L426 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-09-30 20:35:32,678 INFO L422 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse22 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse18 (+ product__local__threadpooling_working_0 1)) (.cse25 (+ product__local__threadpooling_i_1 2)) (.cse29 (+ product__local__threadpooling_i_0 1)) (.cse26 (+ product__local__threadpooling_working_1 1)) (.cse30 (+ product__local__threadpooling_working_0 2)) (.cse27 (+ product__local__threadpooling_i_1 1)) (.cse28 (+ product__local__threadpooling_working_1 2))) (let ((.cse14 (<= .cse28 product__local__threadpooling_i_0)) (.cse13 (<= .cse27 product__local__threadpooling_end_1)) (.cse10 (<= .cse30 product__local__threadpooling_i_1)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse21 (<= .cse26 product__local__threadpooling_end_1)) (.cse17 (<= .cse29 product__global_next)) (.cse8 (<= .cse30 product__local__threadpooling_working_1)) (.cse6 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse25 product__local__threadpooling_working_0)) (.cse2 (<= .cse30 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 .cse27)) (.cse23 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse1 (<= product__local__threadpooling_end_0 .cse29)) (.cse4 (<= .cse28 product__local__threadpooling_working_0)) (.cse15 (<= .cse29 product__local__threadpooling_end_0)) (.cse3 (= product__local__threadpooling_end_0 product__global_next)) (.cse24 (<= .cse18 product__local__threadpooling_end_0)) (.cse19 (and .cse22 .cse11 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse20 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse9 (<= .cse28 product__global_next))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__global_next) .cse1 (and .cse6 .cse7) .cse8 .cse9) (and .cse10 (let ((.cse12 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse11 .cse6 .cse0 .cse7 .cse12 .cse1 .cse13 .cse9) (and .cse14 .cse6 .cse0 .cse12 .cse1 .cse15 .cse13)))) (and (let ((.cse16 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))) (or (and .cse14 .cse0 .cse2 .cse1 .cse3 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse11 .cse16) (and .cse14 .cse0 .cse1 .cse3 .cse13 .cse10 .cse16))) .cse17) (and .cse6 (<= .cse18 product__global_next) .cse19 .cse20 .cse21) (and .cse7 .cse6 .cse20 .cse21 .cse17 .cse1 .cse8) (and (and (and .cse22 .cse11 .cse6) .cse0 .cse9) .cse2) (and .cse22 .cse0 .cse23 .cse3 .cse4 .cse24) (and .cse22 .cse0 .cse3 .cse4 .cse5 .cse24) (and (and .cse11 .cse20 .cse1 .cse3 .cse9) .cse2) (and .cse0 .cse23 .cse1 .cse3 (<= .cse25 product__local__threadpooling_i_0) .cse4 .cse15) (and .cse3 .cse24 (or (and (<= .cse26 product__global_next) (and (<= .cse27 product__global_next) .cse19 .cse20)) (and .cse22 .cse11 .cse20 .cse9)))))) [2018-09-30 20:35:32,678 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-09-30 20:35:32,679 INFO L426 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-09-30 20:35:32,679 INFO L426 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-09-30 20:35:32,709 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:35:32 BoogieIcfgContainer [2018-09-30 20:35:32,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:35:32,710 INFO L168 Benchmark]: Toolchain (without parser) took 77399.39 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 559.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -584.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-30 20:35:32,711 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:35:32,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:35:32,712 INFO L168 Benchmark]: Boogie Preprocessor took 36.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:35:32,713 INFO L168 Benchmark]: RCFGBuilder took 547.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:35:32,714 INFO L168 Benchmark]: TraceAbstraction took 76759.94 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 559.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -603.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-30 20:35:32,717 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 547.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76759.94 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 559.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -603.3 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: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 171]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 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_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_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_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_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 + 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_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 <= _local__threadpooling_i_1 + 1 && _local__threadpooling_i_0 + 2 <= _global_next) && _local__threadpooling_end_0 <= _local__threadpooling_i_0 + 1) && _local__threadpooling_end_1 == _global_next && !(_local__threadpooling_working_1 == _local__threadpooling_i_0)) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1) && _local__threadpooling_working_1 + 2 <= _global_next)) || (_local__threadpooling_working_0 + 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 + 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_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_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_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_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_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_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)) || ((_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))) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((_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_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_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_i_1 + 1 <= _global_next && (((!(_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_i_1 + 1 <= _global_next && (((!(_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 <= _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_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_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_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_0 <= _local__threadpooling_i_0 && _local__threadpooling_end_1 <= _local__threadpooling_i_1 + 1) && _local__threadpooling_end_0 == _global_next) && _local__threadpooling_working_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_i_1 + 2 <= _local__threadpooling_working_0) && _local__threadpooling_working_0 + 1 <= _local__threadpooling_end_0)) || (((_local__threadpooling_end_1 == _global_next && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _local__threadpooling_end_1) && _local__threadpooling_working_0 + 2 <= _local__threadpooling_working_1)) || ((_local__threadpooling_end_0 == _global_next && (((((_local__threadpooling_end_0 <= _local__threadpooling_i_0 && _local__threadpooling_i_1 + 1 <= _global_next) && !(_local__threadpooling_working_0 == _local__threadpooling_working_1)) && _local__threadpooling_end_1 <= _local__threadpooling_i_1) && _local__threadpooling_working_1 + 1 <= _global_next) || (((!(_local__threadpooling_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_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_0 + 2 <= _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_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, 76.6s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 43.8s AutomataDifference, 0.0s DeadEndRemovalTime, 27.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 2038 SDslu, 1072 SDs, 0 SdLazy, 7853 SolverSat, 1166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1514 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 198 NumberOfFragments, 2637 HoareAnnotationTreeSize, 15 FomulaSimplifications, 101354211071 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 170126110 FormulaSimplificationTreeSizeReductionInter, 21.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 9695 SizeOfPredicates, 28 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 26/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-35-32-743.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-09-30_20-35-32-743.csv Received shutdown request...